/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-8fc6572 [2020-07-10 15:09:29,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:09:29,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:09:29,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:09:29,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:09:29,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:09:29,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:09:29,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:09:29,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:09:29,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:09:29,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:09:29,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:09:29,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:09:29,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:09:29,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:09:29,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:09:29,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:09:29,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:09:29,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:09:29,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:09:29,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:09:29,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:09:29,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:09:29,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:09:29,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:09:29,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:09:29,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:09:29,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:09:29,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:09:29,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:09:29,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:09:29,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:09:29,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:09:29,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:09:29,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:09:29,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:09:29,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:09:29,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:09:29,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:09:29,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:09:29,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:09:29,346 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-10 15:09:29,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:09:29,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:09:29,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:09:29,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:09:29,362 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:09:29,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:09:29,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:09:29,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:09:29,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:09:29,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:09:29,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:09:29,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:09:29,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:09:29,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:09:29,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:09:29,364 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:09:29,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:09:29,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:09:29,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:09:29,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:09:29,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:09:29,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:09:29,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:09:29,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:09:29,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:09:29,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:09:29,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:09:29,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:09:29,366 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:09:29,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:09:29,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:09:29,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:09:29,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:09:29,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:09:29,651 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:09:29,651 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-10 15:09:29,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f04f32/b5c728eb45374e54bf1664db94ce330f/FLAG7fa49e80c [2020-07-10 15:09:30,268 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:09:30,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_remove_all.i [2020-07-10 15:09:30,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f04f32/b5c728eb45374e54bf1664db94ce330f/FLAG7fa49e80c [2020-07-10 15:09:30,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f04f32/b5c728eb45374e54bf1664db94ce330f [2020-07-10 15:09:30,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:09:30,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:09:30,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:09:30,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:09:30,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:09:30,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:09:30" (1/1) ... [2020-07-10 15:09:30,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b08e308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:30, skipping insertion in model container [2020-07-10 15:09:30,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:09:30" (1/1) ... [2020-07-10 15:09:30,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:09:30,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:09:31,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:09:31,046 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:09:31,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:09:31,151 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:09:31,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31 WrapperNode [2020-07-10 15:09:31,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:09:31,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:09:31,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:09:31,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:09:31,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (1/1) ... [2020-07-10 15:09:31,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:09:31,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:09:31,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:09:31,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:09:31,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (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-10 15:09:31,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:09:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:09:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:09:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:09:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 15:09:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2020-07-10 15:09:31,300 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2020-07-10 15:09:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_remove_first [2020-07-10 15:09:31,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:09:31,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:09:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:09:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:09:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:09:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:09:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:09:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:09:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:09:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:09:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:09:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:09:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:09:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:09:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:09:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:09:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:09:31,307 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:09:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:09:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:09:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:09:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:09:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:09:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:09:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:09:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:09:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:09:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:09:31,312 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:09:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:09:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:09:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:09:31,313 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:09:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:09:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:09:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:09:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:09:31,314 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:09:31,315 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:09:31,315 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:09:31,315 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:09:31,316 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:09:31,316 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:09:31,316 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:09:31,316 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:09:31,316 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:09:31,316 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:09:31,317 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:09:31,317 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:09:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:09:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:09:31,318 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:09:31,319 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:09:31,320 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:09:31,321 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:09:31,322 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 15:09:31,322 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2020-07-10 15:09:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:09:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:09:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:09:31,323 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure dll_remove_first [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:09:31,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:09:31,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:09:31,678 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 15:09:31,960 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:09:31,960 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:09:31,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:09:31 BoogieIcfgContainer [2020-07-10 15:09:31,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:09:31,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:09:31,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:09:31,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:09:31,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:09:30" (1/3) ... [2020-07-10 15:09:31,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec28157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:09:31, skipping insertion in model container [2020-07-10 15:09:31,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:09:31" (2/3) ... [2020-07-10 15:09:31,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec28157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:09:31, skipping insertion in model container [2020-07-10 15:09:31,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:09:31" (3/3) ... [2020-07-10 15:09:31,974 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2020-07-10 15:09:31,985 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:09:31,993 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:09:32,008 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:09:32,031 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:09:32,031 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:09:32,031 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:09:32,032 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:09:32,032 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:09:32,032 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:09:32,032 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:09:32,032 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:09:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:09:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:09:32,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:32,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:32,059 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1664510762, now seen corresponding path program 1 times [2020-07-10 15:09:32,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:32,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943752165] [2020-07-10 15:09:32,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:32,309 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-10 15:09:32,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:09:32,310 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2020-07-10 15:09:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:32,379 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-10 15:09:32,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-10 15:09:32,381 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2020-07-10 15:09:32,381 INFO L280 TraceCheckUtils]: 3: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:09:32,381 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {40#false} {39#true} #92#return; {40#false} is VALID [2020-07-10 15:09:32,383 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-10 15:09:32,383 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-10 15:09:32,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:09:32,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #98#return; {39#true} is VALID [2020-07-10 15:09:32,385 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret11 := main(); {39#true} is VALID [2020-07-10 15:09:32,385 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-10 15:09:32,387 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-10 15:09:32,387 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-10 15:09:32,388 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-10 15:09:32,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {40#false} is VALID [2020-07-10 15:09:32,389 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:09:32,389 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #92#return; {40#false} is VALID [2020-07-10 15:09:32,389 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-10 15:09:32,390 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 >= 0); {40#false} is VALID [2020-07-10 15:09:32,390 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-10 15:09:32,390 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-10 15:09:32,391 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:09:32,393 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-10 15:09:32,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943752165] [2020-07-10 15:09:32,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:32,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:09:32,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544423814] [2020-07-10 15:09:32,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 15:09:32,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:32,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:09:32,438 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-10 15:09:32,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:09:32,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:32,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:09:32,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:09:32,452 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2020-07-10 15:09:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:32,802 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2020-07-10 15:09:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:09:32,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 15:09:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:09:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-10 15:09:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:09:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-10 15:09:32,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2020-07-10 15:09:32,938 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-10 15:09:32,951 INFO L225 Difference]: With dead ends: 61 [2020-07-10 15:09:32,951 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 15:09:32,955 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-10 15:09:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 15:09:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2020-07-10 15:09:33,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:33,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 29 states. [2020-07-10 15:09:33,010 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 29 states. [2020-07-10 15:09:33,010 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 29 states. [2020-07-10 15:09:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,015 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-10 15:09:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 15:09:33,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:33,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:33,016 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 34 states. [2020-07-10 15:09:33,017 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 34 states. [2020-07-10 15:09:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,021 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-10 15:09:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 15:09:33,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:33,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:33,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:33,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:09:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-10 15:09:33,028 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 17 [2020-07-10 15:09:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:33,028 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-10 15:09:33,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:09:33,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-10 15:09:33,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:09:33,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:33,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:09:33,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:09:33,031 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:33,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1646407191, now seen corresponding path program 1 times [2020-07-10 15:09:33,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:33,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088958515] [2020-07-10 15:09:33,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:33,118 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-10 15:09:33,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} assume true; {244#true} is VALID [2020-07-10 15:09:33,118 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {244#true} {244#true} #98#return; {244#true} is VALID [2020-07-10 15:09:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:33,191 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-10 15:09:33,192 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-10 15:09:33,193 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-10 15:09:33,194 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#(<= |dll_create_#in~len| 0)} assume true; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 15:09:33,195 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-10 15:09:33,197 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-10 15:09:33,197 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-10 15:09:33,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2020-07-10 15:09:33,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #98#return; {244#true} is VALID [2020-07-10 15:09:33,199 INFO L263 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret11 := main(); {244#true} is VALID [2020-07-10 15:09:33,200 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-10 15:09:33,202 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-10 15:09:33,203 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-10 15:09:33,204 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-10 15:09:33,205 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-10 15:09:33,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#(<= |dll_create_#in~len| 0)} assume true; {258#(<= |dll_create_#in~len| 0)} is VALID [2020-07-10 15:09:33,208 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-10 15:09:33,208 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-10 15:09:33,208 INFO L280 TraceCheckUtils]: 13: Hoare triple {245#false} assume !(~i~0 >= 0); {245#false} is VALID [2020-07-10 15:09:33,209 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-10 15:09:33,209 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-10 15:09:33,209 INFO L280 TraceCheckUtils]: 16: Hoare triple {245#false} assume !false; {245#false} is VALID [2020-07-10 15:09:33,211 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-10 15:09:33,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088958515] [2020-07-10 15:09:33,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:33,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:09:33,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887725618] [2020-07-10 15:09:33,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-10 15:09:33,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:33,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:09:33,242 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-10 15:09:33,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:09:33,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:09:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:09:33,243 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 7 states. [2020-07-10 15:09:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,843 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-07-10 15:09:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:09:33,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-10 15:09:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:09:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-10 15:09:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:09:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2020-07-10 15:09:33,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2020-07-10 15:09:33,942 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-10 15:09:33,944 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:09:33,944 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:09:33,945 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-10 15:09:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:09:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-10 15:09:33,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:33,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-10 15:09:33,968 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-10 15:09:33,968 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-10 15:09:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,971 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:09:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:09:33,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:33,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:33,972 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-10 15:09:33,972 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-10 15:09:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:33,975 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:09:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:09:33,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:33,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:33,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:33,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:09:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:09:33,979 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2020-07-10 15:09:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:33,980 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:09:33,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:09:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:09:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:09:33,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:33,981 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-10 15:09:33,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:09:33,982 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1603407070, now seen corresponding path program 1 times [2020-07-10 15:09:33,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:33,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034275063] [2020-07-10 15:09:33,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,108 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-10 15:09:34,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-10 15:09:34,108 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {447#true} {447#true} #98#return; {447#true} is VALID [2020-07-10 15:09:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,204 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-10 15:09:34,205 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-10 15:09:34,206 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-10 15:09:34,208 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-10 15:09:34,209 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-10 15:09:34,209 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-10 15:09:34,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {448#false} assume !(~len > 0); {448#false} is VALID [2020-07-10 15:09:34,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {448#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#false} is VALID [2020-07-10 15:09:34,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {448#false} assume true; {448#false} is VALID [2020-07-10 15:09:34,210 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {448#false} {452#(<= 2 main_~len~0)} #92#return; {448#false} is VALID [2020-07-10 15:09:34,211 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-10 15:09:34,212 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-10 15:09:34,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2020-07-10 15:09:34,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #98#return; {447#true} is VALID [2020-07-10 15:09:34,213 INFO L263 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret11 := main(); {447#true} is VALID [2020-07-10 15:09:34,213 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-10 15:09:34,215 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-10 15:09:34,216 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-10 15:09:34,217 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-10 15:09:34,218 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-10 15:09:34,219 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-10 15:09:34,220 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-10 15:09:34,220 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-10 15:09:34,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {448#false} assume !(~len > 0); {448#false} is VALID [2020-07-10 15:09:34,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {448#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {448#false} is VALID [2020-07-10 15:09:34,221 INFO L280 TraceCheckUtils]: 15: Hoare triple {448#false} assume true; {448#false} is VALID [2020-07-10 15:09:34,221 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {448#false} {452#(<= 2 main_~len~0)} #92#return; {448#false} is VALID [2020-07-10 15:09:34,222 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-10 15:09:34,222 INFO L280 TraceCheckUtils]: 18: Hoare triple {448#false} assume !(~i~0 >= 0); {448#false} is VALID [2020-07-10 15:09:34,222 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-10 15:09:34,222 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-10 15:09:34,223 INFO L280 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2020-07-10 15:09:34,224 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-10 15:09:34,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034275063] [2020-07-10 15:09:34,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:34,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:09:34,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281056623] [2020-07-10 15:09:34,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-10 15:09:34,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:34,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:09:34,259 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-10 15:09:34,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:09:34,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:34,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:09:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:09:34,260 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2020-07-10 15:09:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:34,661 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2020-07-10 15:09:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:09:34,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-07-10 15:09:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-10 15:09:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-10 15:09:34,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2020-07-10 15:09:34,769 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-10 15:09:34,771 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:09:34,771 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:09:34,772 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-10 15:09:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:09:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-07-10 15:09:34,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:34,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2020-07-10 15:09:34,792 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2020-07-10 15:09:34,792 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2020-07-10 15:09:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:34,794 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-10 15:09:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:09:34,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:34,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:34,795 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2020-07-10 15:09:34,795 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2020-07-10 15:09:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:34,797 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-10 15:09:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:09:34,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:34,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:34,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:34,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:09:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-10 15:09:34,800 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2020-07-10 15:09:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:34,801 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-10 15:09:34,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:09:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-10 15:09:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:09:34,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:34,802 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-10 15:09:34,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:09:34,802 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1990495648, now seen corresponding path program 1 times [2020-07-10 15:09:34,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:34,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534377957] [2020-07-10 15:09:34,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,874 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-10 15:09:34,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-10 15:09:34,874 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-10 15:09:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:34,944 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-10 15:09:34,944 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-10 15:09:34,945 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-10 15:09:34,946 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-10 15:09:34,946 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-10 15:09:34,947 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-10 15:09:34,948 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-10 15:09:34,949 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-10 15:09:34,949 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-10 15:09:34,951 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-10 15:09:34,952 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-10 15:09:34,952 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-10 15:09:34,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-10 15:09:34,953 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-10 15:09:34,953 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret11 := main(); {661#true} is VALID [2020-07-10 15:09:34,954 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-10 15:09:34,956 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-10 15:09:34,956 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-10 15:09:34,957 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-10 15:09:34,958 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-10 15:09:34,958 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-10 15:09:34,959 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-10 15:09:34,960 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-10 15:09:34,960 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-10 15:09:34,961 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-10 15:09:34,962 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-10 15:09:34,963 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-10 15:09:34,963 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-10 15:09:34,964 INFO L280 TraceCheckUtils]: 18: Hoare triple {662#false} assume !(~i~0 >= 0); {662#false} is VALID [2020-07-10 15:09:34,964 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-10 15:09:34,964 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-10 15:09:34,964 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#false} assume !false; {662#false} is VALID [2020-07-10 15:09:34,966 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-10 15:09:34,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534377957] [2020-07-10 15:09:34,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386200434] [2020-07-10 15:09:34,967 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-10 15:09:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:35,081 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:09:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:35,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:35,238 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {661#true} is VALID [2020-07-10 15:09:35,239 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-10 15:09:35,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-10 15:09:35,242 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #98#return; {661#true} is VALID [2020-07-10 15:09:35,243 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call #t~ret11 := main(); {661#true} is VALID [2020-07-10 15:09:35,260 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-10 15:09:35,260 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-10 15:09:35,264 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-10 15:09:35,269 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-10 15:09:35,269 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-10 15:09:35,270 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-10 15:09:35,271 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-10 15:09:35,272 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-10 15:09:35,273 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-10 15:09:35,274 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-10 15:09:35,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#(<= |dll_create_#in~len| 1)} assume true; {681#(<= |dll_create_#in~len| 1)} is VALID [2020-07-10 15:09:35,276 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-10 15:09:35,276 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-10 15:09:35,276 INFO L280 TraceCheckUtils]: 18: Hoare triple {662#false} assume !(~i~0 >= 0); {662#false} is VALID [2020-07-10 15:09:35,277 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-10 15:09:35,277 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-10 15:09:35,277 INFO L280 TraceCheckUtils]: 21: Hoare triple {662#false} assume !false; {662#false} is VALID [2020-07-10 15:09:35,278 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-10 15:09:35,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:09:35,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-10 15:09:35,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820901622] [2020-07-10 15:09:35,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-10 15:09:35,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:35,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:09:35,327 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-10 15:09:35,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:09:35,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:09:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:09:35,329 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2020-07-10 15:09:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:35,847 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2020-07-10 15:09:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:09:35,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-10 15:09:35,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:09:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-07-10 15:09:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:09:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-07-10 15:09:35,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2020-07-10 15:09:35,950 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-10 15:09:35,952 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:09:35,952 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:09:35,953 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-10 15:09:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:09:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2020-07-10 15:09:35,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:35,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 35 states. [2020-07-10 15:09:35,982 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 35 states. [2020-07-10 15:09:35,982 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 35 states. [2020-07-10 15:09:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:35,985 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:09:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:09:35,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:35,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:35,986 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states. [2020-07-10 15:09:35,986 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states. [2020-07-10 15:09:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:35,989 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:09:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:09:35,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:35,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:35,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:35,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:09:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-10 15:09:35,992 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2020-07-10 15:09:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:35,992 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-10 15:09:35,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:09:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:09:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:09:35,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:35,993 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-10 15:09:36,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:36,202 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1511329333, now seen corresponding path program 1 times [2020-07-10 15:09:36,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:36,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819550279] [2020-07-10 15:09:36,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:36,294 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-10 15:09:36,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-10 15:09:36,295 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {956#true} {956#true} #98#return; {956#true} is VALID [2020-07-10 15:09:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:36,338 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-10 15:09:36,338 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-10 15:09:36,339 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-10 15:09:36,339 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-10 15:09:36,339 INFO L280 TraceCheckUtils]: 4: Hoare triple {956#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {956#true} is VALID [2020-07-10 15:09:36,339 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-10 15:09:36,340 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-10 15:09:36,340 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-10 15:09:36,340 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-10 15:09:36,340 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-10 15:09:36,341 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-10 15:09:36,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#true} assume !(~len > 0); {956#true} is VALID [2020-07-10 15:09:36,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {956#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {956#true} is VALID [2020-07-10 15:09:36,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-10 15:09:36,343 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {956#true} {961#(<= 2 main_~len~0)} #92#return; {961#(<= 2 main_~len~0)} is VALID [2020-07-10 15:09:36,344 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-10 15:09:36,344 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-10 15:09:36,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-10 15:09:36,345 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #98#return; {956#true} is VALID [2020-07-10 15:09:36,345 INFO L263 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret11 := main(); {956#true} is VALID [2020-07-10 15:09:36,346 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-10 15:09:36,347 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-10 15:09:36,348 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-10 15:09:36,348 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-10 15:09:36,348 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-10 15:09:36,348 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-10 15:09:36,349 INFO L280 TraceCheckUtils]: 11: Hoare triple {956#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {956#true} is VALID [2020-07-10 15:09:36,349 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-10 15:09:36,349 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-10 15:09:36,349 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-10 15:09:36,349 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-10 15:09:36,350 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-10 15:09:36,350 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-10 15:09:36,350 INFO L280 TraceCheckUtils]: 18: Hoare triple {956#true} assume !(~len > 0); {956#true} is VALID [2020-07-10 15:09:36,350 INFO L280 TraceCheckUtils]: 19: Hoare triple {956#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {956#true} is VALID [2020-07-10 15:09:36,351 INFO L280 TraceCheckUtils]: 20: Hoare triple {956#true} assume true; {956#true} is VALID [2020-07-10 15:09:36,352 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {956#true} {961#(<= 2 main_~len~0)} #92#return; {961#(<= 2 main_~len~0)} is VALID [2020-07-10 15:09:36,353 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-10 15:09:36,354 INFO L280 TraceCheckUtils]: 23: Hoare triple {977#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {957#false} is VALID [2020-07-10 15:09:36,354 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-10 15:09:36,354 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-10 15:09:36,355 INFO L280 TraceCheckUtils]: 26: Hoare triple {957#false} assume !false; {957#false} is VALID [2020-07-10 15:09:36,356 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-10 15:09:36,356 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819550279] [2020-07-10 15:09:36,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:09:36,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:09:36,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53407826] [2020-07-10 15:09:36,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:09:36,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:36,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:09:36,387 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-10 15:09:36,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:09:36,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:36,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:09:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:09:36,389 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2020-07-10 15:09:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:36,760 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-10 15:09:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:09:36,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:09:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-10 15:09:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:09:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-10 15:09:36,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-10 15:09:36,826 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-10 15:09:36,829 INFO L225 Difference]: With dead ends: 43 [2020-07-10 15:09:36,829 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:09:36,830 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-10 15:09:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:09:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-10 15:09:36,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:36,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-10 15:09:36,865 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-10 15:09:36,866 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-10 15:09:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:36,870 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-10 15:09:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:09:36,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:36,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:36,871 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-10 15:09:36,871 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-10 15:09:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:36,874 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-10 15:09:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:09:36,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:36,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:36,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:36,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:09:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-07-10 15:09:36,877 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2020-07-10 15:09:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:36,878 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-07-10 15:09:36,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:09:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-10 15:09:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 15:09:36,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:36,879 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-10 15:09:36,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:09:36,880 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1801861723, now seen corresponding path program 1 times [2020-07-10 15:09:36,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:36,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316638554] [2020-07-10 15:09:36,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:36,994 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-10 15:09:36,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:36,995 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-10 15:09:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:37,046 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-10 15:09:37,047 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-10 15:09:37,047 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-10 15:09:37,047 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-10 15:09:37,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-10 15:09:37,048 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-10 15:09:37,048 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-10 15:09:37,048 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-10 15:09:37,049 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-10 15:09:37,050 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-10 15:09:37,050 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-10 15:09:37,050 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-10 15:09:37,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-10 15:09:37,051 INFO L280 TraceCheckUtils]: 13: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,058 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-10 15:09:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:37,090 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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1174#true} is VALID [2020-07-10 15:09:37,090 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-10 15:09:37,091 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-10 15:09:37,091 INFO L280 TraceCheckUtils]: 3: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,092 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-10 15:09:37,094 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-10 15:09:37,094 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-10 15:09:37,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,095 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-10 15:09:37,095 INFO L263 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret11 := main(); {1174#true} is VALID [2020-07-10 15:09:37,096 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-10 15:09:37,097 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-10 15:09:37,098 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-10 15:09:37,098 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-10 15:09:37,098 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-10 15:09:37,098 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-10 15:09:37,099 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-10 15:09:37,099 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-10 15:09:37,099 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-10 15:09:37,099 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-10 15:09:37,100 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-10 15:09:37,100 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-10 15:09:37,100 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-10 15:09:37,100 INFO L280 TraceCheckUtils]: 18: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-10 15:09:37,101 INFO L280 TraceCheckUtils]: 19: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-10 15:09:37,101 INFO L280 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,102 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-10 15:09:37,104 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-10 15:09:37,105 INFO L280 TraceCheckUtils]: 23: Hoare triple {1195#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {1195#(<= 1 main_~i~0)} is VALID [2020-07-10 15:09:37,106 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-10 15:09:37,107 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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1174#true} is VALID [2020-07-10 15:09:37,107 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-10 15:09:37,107 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-10 15:09:37,107 INFO L280 TraceCheckUtils]: 28: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,108 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-10 15:09:37,110 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-10 15:09:37,112 INFO L280 TraceCheckUtils]: 31: Hoare triple {1201#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1175#false} is VALID [2020-07-10 15:09:37,113 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-10 15:09:37,113 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-10 15:09:37,113 INFO L280 TraceCheckUtils]: 34: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2020-07-10 15:09:37,115 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-10 15:09:37,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316638554] [2020-07-10 15:09:37,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520947589] [2020-07-10 15:09:37,116 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-10 15:09:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:37,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:09:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:37,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:37,281 INFO L263 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2020-07-10 15:09:37,281 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-10 15:09:37,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,282 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #98#return; {1174#true} is VALID [2020-07-10 15:09:37,282 INFO L263 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret11 := main(); {1174#true} is VALID [2020-07-10 15:09:37,283 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-10 15:09:37,283 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-10 15:09:37,283 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-10 15:09:37,284 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-10 15:09:37,284 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-10 15:09:37,284 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-10 15:09:37,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {1174#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1174#true} is VALID [2020-07-10 15:09:37,285 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-10 15:09:37,285 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-10 15:09:37,285 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-10 15:09:37,285 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-10 15:09:37,286 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-10 15:09:37,286 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-10 15:09:37,286 INFO L280 TraceCheckUtils]: 18: Hoare triple {1174#true} assume !(~len > 0); {1174#true} is VALID [2020-07-10 15:09:37,286 INFO L280 TraceCheckUtils]: 19: Hoare triple {1174#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1174#true} is VALID [2020-07-10 15:09:37,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,287 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1174#true} {1179#(<= 2 main_~len~0)} #92#return; {1179#(<= 2 main_~len~0)} is VALID [2020-07-10 15:09:37,289 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-10 15:09:37,290 INFO L280 TraceCheckUtils]: 23: Hoare triple {1195#(<= 1 main_~i~0)} assume !!(~i~0 >= 0); {1195#(<= 1 main_~i~0)} is VALID [2020-07-10 15:09:37,290 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-10 15:09:37,290 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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1174#true} is VALID [2020-07-10 15:09:37,291 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-10 15:09:37,291 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-10 15:09:37,291 INFO L280 TraceCheckUtils]: 28: Hoare triple {1174#true} assume true; {1174#true} is VALID [2020-07-10 15:09:37,292 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1174#true} {1195#(<= 1 main_~i~0)} #94#return; {1195#(<= 1 main_~i~0)} is VALID [2020-07-10 15:09:37,293 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-10 15:09:37,293 INFO L280 TraceCheckUtils]: 31: Hoare triple {1201#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {1175#false} is VALID [2020-07-10 15:09:37,294 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-10 15:09:37,294 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-10 15:09:37,294 INFO L280 TraceCheckUtils]: 34: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2020-07-10 15:09:37,295 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-10 15:09:37,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:09:37,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2020-07-10 15:09:37,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925539748] [2020-07-10 15:09:37,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-10 15:09:37,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:09:37,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:09:37,335 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-10 15:09:37,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:09:37,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:09:37,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:09:37,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:09:37,336 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 8 states. [2020-07-10 15:09:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:37,771 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-10 15:09:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:09:37,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2020-07-10 15:09:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:09:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:09:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-10 15:09:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:09:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-10 15:09:37,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-10 15:09:37,822 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-10 15:09:37,826 INFO L225 Difference]: With dead ends: 44 [2020-07-10 15:09:37,827 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 15:09:37,827 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-10 15:09:37,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 15:09:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-10 15:09:37,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:09:37,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-10 15:09:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-10 15:09:37,858 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-10 15:09:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:37,860 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:09:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:09:37,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:37,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:37,862 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-10 15:09:37,862 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-10 15:09:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:09:37,865 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-10 15:09:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-10 15:09:37,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:09:37,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:09:37,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:09:37,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:09:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:09:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-10 15:09:37,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 35 [2020-07-10 15:09:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:09:37,871 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-10 15:09:37,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:09:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:09:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 15:09:37,874 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:09:37,875 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-10 15:09:38,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:09:38,090 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:09:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:09:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1626595457, now seen corresponding path program 2 times [2020-07-10 15:09:38,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:09:38,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325868297] [2020-07-10 15:09:38,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:09:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:38,472 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-10 15:09:38,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-10 15:09:38,473 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-10 15:09:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:39,085 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-10 15:09:39,086 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-10 15:09:39,087 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-10 15:09:39,088 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 (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-10 15:09:39,089 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 (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)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1552#(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-10 15:09:39,096 INFO L280 TraceCheckUtils]: 5: Hoare triple {1552#(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; {1553#(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-10 15:09:39,097 INFO L280 TraceCheckUtils]: 6: Hoare triple {1553#(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; {1554#(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-10 15:09:39,097 INFO L280 TraceCheckUtils]: 7: 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 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); {1554#(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-10 15:09:39,099 INFO L280 TraceCheckUtils]: 8: 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 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); {1555#(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-10 15:09:39,101 INFO L280 TraceCheckUtils]: 9: Hoare triple {1555#(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); {1556#(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-10 15:09:39,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {1556#(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; {1557#(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-10 15:09:39,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {1557#(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); {1557#(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-10 15:09:39,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {1557#(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; {1558#(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-10 15:09:39,103 INFO L280 TraceCheckUtils]: 13: Hoare triple {1558#(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; {1558#(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-10 15:09:39,110 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1558#(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-10 15:09:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:39,397 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2020-07-10 15:09:39,614 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2020-07-10 15:09:39,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1560#(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-10 15:09:39,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {1560#(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); {1561#(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-10 15:09:39,728 INFO L280 TraceCheckUtils]: 2: Hoare triple {1561#(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); {1562#(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-10 15:09:39,729 INFO L280 TraceCheckUtils]: 3: Hoare triple {1562#(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; {1562#(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-10 15:09:39,732 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1562#(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-10 15:09:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:39,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1563#(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-10 15:09:39,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {1563#(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|)))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1563#(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-10 15:09:39,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {1563#(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); {1564#(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-10 15:09:39,891 INFO L280 TraceCheckUtils]: 3: Hoare triple {1564#(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; {1564#(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-10 15:09:39,893 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1564#(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-10 15:09:39,894 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-10 15:09:39,894 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-10 15:09:39,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-10 15:09:39,895 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-10 15:09:39,895 INFO L263 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret11 := main(); {1512#true} is VALID [2020-07-10 15:09:39,896 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-10 15:09:39,897 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-10 15:09:39,898 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-10 15:09:39,899 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-10 15:09:39,900 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-10 15:09:39,902 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 (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-10 15:09:39,903 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 (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)))} assume !(~head~0.base != 0 || ~head~0.offset != 0); {1552#(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-10 15:09:39,906 INFO L280 TraceCheckUtils]: 12: Hoare triple {1552#(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; {1553#(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-10 15:09:39,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {1553#(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; {1554#(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-10 15:09:39,908 INFO L280 TraceCheckUtils]: 14: 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 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); {1554#(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-10 15:09:39,910 INFO L280 TraceCheckUtils]: 15: 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 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); {1555#(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-10 15:09:39,912 INFO L280 TraceCheckUtils]: 16: Hoare triple {1555#(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); {1556#(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-10 15:09:39,913 INFO L280 TraceCheckUtils]: 17: Hoare triple {1556#(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; {1557#(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-10 15:09:39,915 INFO L280 TraceCheckUtils]: 18: Hoare triple {1557#(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); {1557#(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-10 15:09:39,916 INFO L280 TraceCheckUtils]: 19: Hoare triple {1557#(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; {1558#(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-10 15:09:39,916 INFO L280 TraceCheckUtils]: 20: Hoare triple {1558#(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; {1558#(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-10 15:09:39,918 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1558#(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-10 15:09:39,919 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-10 15:09:39,920 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-10 15:09:39,921 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); {1559#(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-10 15:09:39,922 INFO L280 TraceCheckUtils]: 25: Hoare triple {1559#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1560#(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-10 15:09:39,924 INFO L280 TraceCheckUtils]: 26: Hoare triple {1560#(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); {1561#(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-10 15:09:39,926 INFO L280 TraceCheckUtils]: 27: Hoare triple {1561#(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); {1562#(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-10 15:09:39,927 INFO L280 TraceCheckUtils]: 28: Hoare triple {1562#(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; {1562#(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-10 15:09:39,929 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1562#(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-10 15:09:39,929 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-10 15:09:39,930 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-10 15:09:39,931 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); {1559#(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-10 15:09:39,933 INFO L280 TraceCheckUtils]: 33: Hoare triple {1559#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1563#(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-10 15:09:39,934 INFO L280 TraceCheckUtils]: 34: Hoare triple {1563#(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|)))} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {1563#(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-10 15:09:39,936 INFO L280 TraceCheckUtils]: 35: Hoare triple {1563#(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); {1564#(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-10 15:09:39,936 INFO L280 TraceCheckUtils]: 36: Hoare triple {1564#(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; {1564#(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-10 15:09:39,937 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1564#(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-10 15:09:39,938 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-10 15:09:39,938 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-10 15:09:39,939 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-10 15:09:39,940 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-10 15:09:39,940 INFO L280 TraceCheckUtils]: 42: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2020-07-10 15:09:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:09:39,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325868297] [2020-07-10 15:09:39,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755257154] [2020-07-10 15:09:39,957 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-10 15:09:40,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:09:40,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:09:40,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 84 conjunts are in the unsatisfiable core [2020-07-10 15:09:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:09:40,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:09:40,252 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-10 15:09:40,253 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,263 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,264 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,264 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2020-07-10 15:09:40,267 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:40,268 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-10 15:09:40,268 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-10 15:09:40,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,364 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-10 15:09:40,364 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,376 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,384 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-10 15:09:40,384 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,399 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,400 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,400 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:48 [2020-07-10 15:09:40,672 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,673 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-10 15:09:40,675 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,689 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,690 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,691 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2020-07-10 15:09:40,820 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-10 15:09:40,861 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,865 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-10 15:09:40,911 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,938 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-10 15:09:40,945 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:40,971 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:40,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:40,994 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-10 15:09:41,001 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:41,029 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:41,031 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:41,031 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:75 [2020-07-10 15:09:42,296 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:42,296 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-10 15:09:42,297 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-10 15:09:42,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:42,536 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:42,537 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-10 15:09:42,559 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[14, 3, 2, 1] term [2020-07-10 15:09:42,559 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:42,573 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:42,649 INFO L624 ElimStorePlain]: treesize reduction 134, result has 47.7 percent of original size [2020-07-10 15:09:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:42,662 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-10 15:09:42,666 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:09:42,689 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:09:42,689 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:09:42,690 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:99 [2020-07-10 15:09:44,796 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:09:44,797 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-10 15:09:44,797 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-10 15:09:46,570 WARN L193 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2020-07-10 15:09:46,571 INFO L350 Elim1Store]: treesize reduction 181, result has 64.4 percent of original size [2020-07-10 15:09:46,571 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-10 15:09:46,602 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:46,619 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:46,638 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:46,658 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:46,676 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:46,700 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:46,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:46,730 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:46,740 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:46,745 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:46,749 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:46,753 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:46,786 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,808 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,832 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,837 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:46,854 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,871 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:46,888 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,894 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,911 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:46,927 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:46,962 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:46,970 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:46,977 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:46,983 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:46,987 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,005 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,024 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,041 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,046 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,071 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,091 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,119 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,124 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,147 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,180 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,216 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:47,233 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:47,247 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:47,263 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:47,272 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:47,282 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:47,289 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:47,295 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,301 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,307 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,328 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,348 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,368 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,390 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,415 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,430 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,446 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,450 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,465 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,478 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,501 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:47,509 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:47,514 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,519 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,523 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,542 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,557 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,573 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,577 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,607 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,624 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,628 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,645 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,662 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,681 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:47,688 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:47,692 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,697 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,701 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:47,704 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,713 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,736 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:47,740 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:47,751 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:47,763 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:47,768 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,782 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,799 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:47,808 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,822 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:47,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:47,841 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,858 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,874 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:47,878 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,895 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:47,941 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:47,954 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:47,971 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:47,983 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:47,993 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:48,000 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:48,008 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,015 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,023 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,027 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,031 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,043 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,067 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,072 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,089 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,107 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,112 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,117 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,133 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,157 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,162 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,200 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,208 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:09:48,212 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:48,223 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:48,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,240 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,254 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,272 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,286 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,296 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,300 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,324 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,337 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:48,342 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,372 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,392 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,402 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,408 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,425 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,442 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,446 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,470 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,488 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,505 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,522 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,542 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,547 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,567 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,619 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:48,637 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:48,654 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:48,668 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:48,686 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:48,697 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:48,707 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,715 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,723 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,732 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,758 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,789 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,815 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:48,844 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,870 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:48,942 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:48,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:48,963 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:48,985 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,006 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:49,011 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,033 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,057 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:49,063 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,084 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,133 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,152 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:49,166 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:49,176 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:49,184 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:49,198 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:49,206 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:49,213 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:49,219 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,241 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,246 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,261 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,278 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,294 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,299 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,314 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,330 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,347 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,352 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,369 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,387 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,411 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,417 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:49,422 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,426 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,430 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:49,434 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,449 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:49,454 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:49,474 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,490 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,494 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:49,498 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:49,515 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:49,527 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:49,530 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,577 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,590 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,603 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:49,614 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:49,628 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:49,637 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:49,644 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:49,650 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,656 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,661 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,676 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,693 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,711 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,716 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,732 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,751 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:49,769 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,774 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,793 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:49,810 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:49,860 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,884 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,906 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,925 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:49,947 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:49,968 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:49,987 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:50,000 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:50,010 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:50,018 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,026 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,033 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,059 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,084 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,116 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,123 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,147 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,171 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,197 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,204 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,229 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,252 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,282 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:50,293 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:50,301 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,310 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,318 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,342 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,368 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,394 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,401 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,425 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,449 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,474 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,479 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,502 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,532 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,611 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:50,631 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:50,646 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:50,662 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:50,672 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:50,683 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:50,691 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:50,698 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,706 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,712 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,736 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,760 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,785 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,791 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,812 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,834 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,856 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,861 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,882 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,903 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,933 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:50,942 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:50,950 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:50,957 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:50,963 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:50,985 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,008 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,029 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,036 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,055 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,076 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,101 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:51,107 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,132 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:51,158 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,186 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:51,194 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:51,200 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,206 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,210 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,213 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,225 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,239 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:51,242 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,254 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,267 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,271 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,286 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,300 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,305 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,308 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,321 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,336 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:51,339 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,353 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:51,374 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,391 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,431 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:51,447 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:51,463 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:51,475 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:51,483 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:51,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:51,497 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,505 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,511 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,515 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:51,519 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,532 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,555 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,562 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,581 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,603 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,609 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:51,614 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,632 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,657 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:51,663 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,682 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,703 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,713 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:09:51,718 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:51,732 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:51,747 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:51,752 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,767 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,785 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,792 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,807 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,821 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,835 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:51,841 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,859 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,880 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,890 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,895 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,914 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:51,932 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:51,936 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,950 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:51,967 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:51,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:51,983 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,001 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,019 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,024 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,039 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,070 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:52,083 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:52,095 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:52,107 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:52,128 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,144 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:52,151 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,158 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,163 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:52,169 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:52,187 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:52,206 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,212 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,230 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,250 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:52,256 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:52,275 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:52,295 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,306 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,331 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,371 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:52,375 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,394 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,406 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,416 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,427 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,462 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:52,481 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:52,490 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:52,498 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:52,504 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:52,514 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:52,520 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:52,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:52,530 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,534 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,538 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,550 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,564 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,579 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,583 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,594 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,610 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,626 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,630 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,645 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,659 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,676 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,681 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:52,685 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,689 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:52,695 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,708 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:52,711 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,724 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,727 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,739 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,742 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,747 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,758 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:52,761 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:52,773 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:52,777 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,808 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:52,819 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:52,830 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:52,838 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:52,847 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:52,858 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:52,864 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:52,868 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,872 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,877 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,894 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,906 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,918 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,923 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,933 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,944 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:52,956 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:52,964 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:52,982 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:53,000 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:53,019 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-10 15:09:53,221 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2020-07-10 15:09:53,224 INFO L624 ElimStorePlain]: treesize reduction 359, result has 41.8 percent of original size [2020-07-10 15:09:53,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:09:53,358 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2020-07-10 15:09:53,359 INFO L350 Elim1Store]: treesize reduction 32, result has 79.6 percent of original size [2020-07-10 15:09:53,359 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-10 15:09:53,382 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:53,390 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:53,398 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:53,410 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:53,417 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,428 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,436 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,442 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,444 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,462 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:53,471 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,495 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,497 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,499 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,512 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:53,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,530 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,534 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,538 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,555 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:53,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,566 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,582 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,585 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:53,586 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:53,596 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,619 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,634 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:53,639 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,649 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,651 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,668 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:53,670 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,688 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,696 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,708 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,712 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,717 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:53,718 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,735 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,756 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,760 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:53,774 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,778 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,783 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,794 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,796 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,813 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:53,837 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,842 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:53,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,861 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,865 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,867 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,885 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:53,901 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,908 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,912 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,915 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:53,928 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:53,930 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,936 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,949 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,953 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,972 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:53,974 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:53,975 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:53,978 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,992 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:53,994 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:53,998 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,042 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,054 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,060 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,066 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,079 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,084 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,091 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,093 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,097 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,116 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,143 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,149 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,152 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,164 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,169 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,186 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,198 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:54,199 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,209 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,226 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,240 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,247 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,274 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,282 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,288 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,296 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,306 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,319 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,326 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,329 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,352 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,369 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,373 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,390 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,395 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,399 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,410 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,413 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,420 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,424 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,428 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:54,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,472 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,474 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,479 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,506 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,518 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,525 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,530 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,533 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,550 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,554 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,572 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,599 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:54,612 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,616 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,631 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,643 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:54,649 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,654 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:54,656 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,673 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,685 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:54,688 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,699 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:54,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,716 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:54,718 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,721 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:54,739 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:54,747 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:54,755 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,764 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,781 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:54,788 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,795 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,801 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,804 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,830 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,838 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:54,843 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:54,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,893 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,914 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:54,920 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,924 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,930 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,951 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:54,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:54,960 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:54,985 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,003 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,014 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,021 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,029 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,048 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,058 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,062 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,108 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,113 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,132 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,138 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,145 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,163 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,169 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,177 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,183 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,197 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:55,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:55,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,237 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,246 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,265 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,267 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,272 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,314 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,321 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,351 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,366 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,372 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,392 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,399 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,412 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,417 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,452 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:55,464 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,473 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,482 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,491 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,498 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,504 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,510 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,514 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:55,516 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:55,535 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,542 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,546 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,571 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,585 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,591 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,594 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,632 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,635 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,650 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,656 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,661 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,665 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,668 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,678 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,683 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,700 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,704 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,707 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,710 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,723 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,725 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,741 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,747 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,752 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,757 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,764 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,781 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,791 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,797 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,800 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,810 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,824 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,831 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:55,833 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:55,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:55,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:55,871 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:55,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,886 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:55,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,897 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:55,900 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:55,902 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:55,924 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,944 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,959 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:55,964 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:55,983 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:55,990 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:55,993 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,023 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,038 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,046 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,053 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,058 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,061 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,084 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,102 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,113 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,119 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,126 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,130 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,153 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:56,168 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,180 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,189 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:56,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,204 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,210 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,213 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,236 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,239 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,266 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,273 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,279 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,298 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,306 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:56,309 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:56,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:56,380 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:56,389 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,397 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:56,404 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,411 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,417 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,431 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,448 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,454 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,457 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,482 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,491 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,500 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,508 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,515 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,522 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:56,534 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,540 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:56,542 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,563 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,571 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,574 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,595 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,603 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:56,610 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,616 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,620 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,623 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,646 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,652 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,657 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,660 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,683 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:56,693 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:56,701 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,714 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:56,720 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,726 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,732 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,737 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,743 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,748 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,751 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,772 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:56,782 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,788 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,802 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,806 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,808 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,811 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:56,826 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:56,828 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,840 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,847 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,866 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:56,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,872 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,888 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,891 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:56,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:56,902 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:56,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,943 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,961 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,966 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:56,969 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:56,972 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:56,988 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:56,991 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,007 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,011 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,015 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,028 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,035 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,036 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,048 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,064 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,068 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,072 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:57,087 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,092 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,097 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,111 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,134 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:57,144 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,151 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:57,158 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,166 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,171 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,174 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,195 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:57,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,230 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,244 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,247 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,257 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,291 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,293 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,311 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,316 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,318 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,331 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:57,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,335 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,382 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,388 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,393 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,410 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,413 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,417 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,420 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,421 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,423 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,436 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,436 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,438 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,460 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,462 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,465 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,476 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,479 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,491 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,501 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:57,502 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,513 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,518 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,525 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,537 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,541 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,543 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,561 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,565 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,573 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,576 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,588 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,593 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,595 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,610 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,623 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,626 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:57,640 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:57,643 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,646 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,657 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,660 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,664 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,667 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,670 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:57,688 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,690 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,703 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,714 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,716 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,719 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,744 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,750 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,755 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,766 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,774 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,791 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,795 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:57,808 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:57,813 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,832 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,842 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:57,851 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,854 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,866 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,876 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:57,880 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,884 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:57,885 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,898 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,907 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-10 15:09:57,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,918 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:57,920 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,930 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:57,932 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:57,933 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:57,954 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:57,961 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:57,969 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,976 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:57,989 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:57,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,000 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,004 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,011 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,031 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,035 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,039 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,055 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,059 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,085 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,106 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,111 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,114 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,120 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,140 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,142 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,146 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,169 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,184 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,192 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,199 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,205 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,218 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,227 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,251 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,264 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,268 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,280 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,285 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,292 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,305 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,309 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,321 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,333 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:58,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,359 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:58,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:58,380 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,389 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:58,396 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,402 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,406 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,408 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,412 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,448 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,455 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,460 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,475 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,498 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,502 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,505 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,520 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,526 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,539 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,544 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,574 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 16 disjuncts [2020-07-10 15:09:58,584 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:58,595 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:58,604 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,612 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,620 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,627 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,632 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,638 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 11 disjuncts [2020-07-10 15:09:58,641 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-10 15:09:58,660 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,666 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,669 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,689 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,699 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,702 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,719 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,722 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,748 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,758 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:58,767 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,773 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,779 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:58,793 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:58,800 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,803 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,824 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,830 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,837 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:58,841 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,862 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,864 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,891 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:58,903 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,913 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:58,920 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,926 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:58,932 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:58,935 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,957 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:58,974 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:58,984 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,991 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:58,999 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,017 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,026 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:59,030 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:59,069 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:59,075 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:59,082 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:59,088 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,093 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:59,097 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,101 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,104 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,105 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,121 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,136 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,147 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,154 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,158 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,171 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,176 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:59,178 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,197 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,203 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,209 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,215 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,219 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,224 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,237 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,248 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,255 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,258 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,262 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,264 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,278 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:59,289 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:59,295 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,301 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:59,305 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,309 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,313 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,315 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,331 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,333 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,350 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,358 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,376 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:59,378 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,409 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:59,425 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:59,432 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 16 disjuncts [2020-07-10 15:09:59,441 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,448 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:59,455 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,460 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,464 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,478 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,486 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,491 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,496 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,498 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,521 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,529 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,537 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,543 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,549 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,553 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:59,564 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:59,572 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-10 15:09:59,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-10 15:09:59,593 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,599 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,604 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,606 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,627 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,634 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 15 disjuncts [2020-07-10 15:09:59,639 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,646 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2020-07-10 15:09:59,650 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 13 disjuncts [2020-07-10 15:09:59,653 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-07-10 15:09:59,673 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,679 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-10 15:09:59,684 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 14 disjuncts [2020-07-10 15:09:59,687 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 13 disjuncts [2020-07-10 15:09:59,702 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-10 15:09:59,865 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-07-10 15:09:59,867 INFO L624 ElimStorePlain]: treesize reduction 135, result has 54.8 percent of original size [2020-07-10 15:09:59,877 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:59,883 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:59,887 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:09:59,891 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:59,911 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:09:59,916 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:09:59,930 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:59,934 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:09:59,942 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:09:59,956 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:09:59,960 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:09:59,972 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-10 15:09:59,972 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:443, output treesize:164 [2020-07-10 15:10:02,589 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:10:02,590 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-10 15:10:02,590 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-10 15:10:02,607 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:02,614 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:02,620 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:02,624 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:02,645 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:02,652 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:02,667 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:02,671 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:02,679 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:02,692 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:02,696 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:02,996 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:03,004 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:03,009 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:03,011 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:03,017 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:03,020 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:03,027 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:03,030 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:03,034 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:03,039 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:03,047 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:03,049 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:10:03,057 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:03,445 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:03,467 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:03,473 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:03,476 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:03,485 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:03,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:03,498 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:03,502 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:03,506 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:03,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:03,521 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:03,523 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-10 15:10:03,532 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-10 15:10:03,957 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:03,966 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:03,971 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,008 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,013 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,021 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,023 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,031 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,315 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,333 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,336 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,347 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,352 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,362 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,373 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,376 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,383 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,404 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,415 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,422 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,424 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,433 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,438 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,448 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,457 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,459 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,463 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,469 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:10:04,475 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,484 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,490 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,495 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,504 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,510 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,520 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,532 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,535 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,540 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,554 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,579 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,589 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,595 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,602 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,615 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,618 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,626 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,644 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,657 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,662 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,665 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,673 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,677 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,685 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,698 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,701 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,708 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,726 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,739 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,745 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,750 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,760 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,766 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,774 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,788 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,792 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,799 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,815 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,827 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,833 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,838 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,848 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,854 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,862 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,876 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,879 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,886 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,900 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,915 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,918 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:04,927 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-10 15:10:04,932 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-10 15:10:04,940 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,950 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-10 15:10:04,953 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-10 15:10:04,959 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-10 15:10:05,083 INFO L263 TraceCheckUtils]: 0: Hoare triple {1512#true} call ULTIMATE.init(); {1512#true} is VALID [2020-07-10 15:10:05,083 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-10 15:10:05,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {1512#true} assume true; {1512#true} is VALID [2020-07-10 15:10:05,084 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1512#true} {1512#true} #98#return; {1512#true} is VALID [2020-07-10 15:10:05,084 INFO L263 TraceCheckUtils]: 4: Hoare triple {1512#true} call #t~ret11 := main(); {1512#true} is VALID [2020-07-10 15:10:05,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {1512#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {1583#(< |#StackHeapBarrier| |main_~#s~0.base|)} is VALID [2020-07-10 15:10:05,085 INFO L263 TraceCheckUtils]: 6: Hoare triple {1583#(< |#StackHeapBarrier| |main_~#s~0.base|)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {1512#true} is VALID [2020-07-10 15:10:05,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {1512#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1590#(and (= 0 dll_create_~head~0.offset) (= 0 dll_create_~head~0.base))} is VALID [2020-07-10 15:10:05,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {1590#(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; {1594#(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-10 15:10:05,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {1594#(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); {1594#(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-10 15:10:05,091 INFO L280 TraceCheckUtils]: 10: Hoare triple {1594#(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); {1601#(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-10 15:10:05,092 INFO L280 TraceCheckUtils]: 11: Hoare triple {1601#(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); {1601#(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-10 15:10:05,094 INFO L280 TraceCheckUtils]: 12: Hoare triple {1601#(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; {1608#(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-10 15:10:05,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {1608#(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; {1612#(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-10 15:10:05,096 INFO L280 TraceCheckUtils]: 14: Hoare triple {1612#(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); {1612#(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-10 15:10:05,099 INFO L280 TraceCheckUtils]: 15: Hoare triple {1612#(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); {1619#(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-10 15:10:05,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {1619#(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); {1623#(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-10 15:10:05,104 INFO L280 TraceCheckUtils]: 17: Hoare triple {1623#(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; {1627#(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-10 15:10:05,105 INFO L280 TraceCheckUtils]: 18: Hoare triple {1627#(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); {1627#(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-10 15:10:05,108 INFO L280 TraceCheckUtils]: 19: Hoare triple {1627#(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; {1634#(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-10 15:10:05,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {1634#(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; {1634#(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-10 15:10:05,113 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1634#(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))))} {1583#(< |#StackHeapBarrier| |main_~#s~0.base|)} #92#return; {1641#(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-10 15:10:05,116 INFO L280 TraceCheckUtils]: 22: Hoare triple {1641#(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; {1645#(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-10 15:10:05,117 INFO L280 TraceCheckUtils]: 23: Hoare triple {1645#(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); {1645#(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-10 15:10:05,119 INFO L263 TraceCheckUtils]: 24: Hoare triple {1645#(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); {1652#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:10:05,120 INFO L280 TraceCheckUtils]: 25: Hoare triple {1652#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1656#(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-10 15:10:05,123 INFO L280 TraceCheckUtils]: 26: Hoare triple {1656#(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); {1660#(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-10 15:10:05,125 INFO L280 TraceCheckUtils]: 27: Hoare triple {1660#(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); {1664#(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-10 15:10:05,127 INFO L280 TraceCheckUtils]: 28: Hoare triple {1664#(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; {1664#(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-10 15:10:05,629 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1664#(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|))} {1645#(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; {1671#(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-10 15:10:05,633 INFO L280 TraceCheckUtils]: 30: Hoare triple {1671#(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; {1671#(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-10 15:10:05,638 INFO L280 TraceCheckUtils]: 31: Hoare triple {1671#(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); {1671#(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-10 15:10:05,643 INFO L263 TraceCheckUtils]: 32: Hoare triple {1671#(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); {1652#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:10:05,648 INFO L280 TraceCheckUtils]: 33: Hoare triple {1652#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {1684#(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-10 15:10:05,649 INFO L280 TraceCheckUtils]: 34: Hoare triple {1684#(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); {1688#(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-10 15:10:05,650 INFO L280 TraceCheckUtils]: 35: Hoare triple {1688#(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); {1688#(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-10 15:10:05,652 INFO L280 TraceCheckUtils]: 36: Hoare triple {1688#(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; {1688#(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-10 15:10:05,656 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1688#(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)))))} {1671#(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-10 15:10:05,657 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-10 15:10:05,657 INFO L280 TraceCheckUtils]: 39: Hoare triple {1513#false} assume !(~i~0 >= 0); {1513#false} is VALID [2020-07-10 15:10:05,657 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-10 15:10:05,658 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-10 15:10:05,658 INFO L280 TraceCheckUtils]: 42: Hoare triple {1513#false} assume !false; {1513#false} is VALID [2020-07-10 15:10:05,676 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-10 15:10:05,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:10:05,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2020-07-10 15:10:05,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260512139] [2020-07-10 15:10:05,679 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2020-07-10 15:10:05,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:10:05,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2020-07-10 15:10:07,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:10:07,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-07-10 15:10:07,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:10:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-07-10 15:10:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1788, Unknown=0, NotChecked=0, Total=1892 [2020-07-10 15:10:07,933 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 44 states. [2020-07-10 15:10:11,419 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-07-10 15:10:11,877 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2020-07-10 15:10:12,264 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-07-10 15:10:12,720 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2020-07-10 15:10:14,192 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2020-07-10 15:10:17,599 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2020-07-10 15:10:18,227 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2020-07-10 15:10:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:22,664 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2020-07-10 15:10:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-10 15:10:22,664 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2020-07-10 15:10:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:10:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:10:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2020-07-10 15:10:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:10:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2020-07-10 15:10:22,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 103 transitions. [2020-07-10 15:10:23,056 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-10 15:10:23,061 INFO L225 Difference]: With dead ends: 89 [2020-07-10 15:10:23,061 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:10:23,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=291, Invalid=4679, Unknown=0, NotChecked=0, Total=4970 [2020-07-10 15:10:23,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:10:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2020-07-10 15:10:23,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:10:23,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 56 states. [2020-07-10 15:10:23,154 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 56 states. [2020-07-10 15:10:23,155 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 56 states. [2020-07-10 15:10:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:23,159 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-10 15:10:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-10 15:10:23,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:23,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:23,160 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 75 states. [2020-07-10 15:10:23,160 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 75 states. [2020-07-10 15:10:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:23,165 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-10 15:10:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2020-07-10 15:10:23,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:23,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:23,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:10:23,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:10:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 15:10:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2020-07-10 15:10:23,169 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 43 [2020-07-10 15:10:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:10:23,170 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2020-07-10 15:10:23,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-07-10 15:10:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2020-07-10 15:10:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:10:23,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:10:23,171 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-10 15:10:23,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:10:23,388 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:10:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:10:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1394437068, now seen corresponding path program 3 times [2020-07-10 15:10:23,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:10:23,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172621190] [2020-07-10 15:10:23,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:10:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:23,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {2151#(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; {2115#true} is VALID [2020-07-10 15:10:23,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:23,460 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2115#true} {2115#true} #98#return; {2115#true} is VALID [2020-07-10 15:10:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:23,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {2152#(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; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {2153#(= 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; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,563 INFO L280 TraceCheckUtils]: 3: Hoare triple {2153#(= 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); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {2153#(= 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; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {2154#(<= (+ 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; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,567 INFO L280 TraceCheckUtils]: 8: Hoare triple {2154#(<= (+ 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); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {2154#(<= (+ 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); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {2154#(<= (+ 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; {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {2155#(<= (+ 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; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,572 INFO L280 TraceCheckUtils]: 12: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {2156#(<= 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); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {2156#(<= 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); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,574 INFO L280 TraceCheckUtils]: 15: Hoare triple {2156#(<= 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; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,575 INFO L280 TraceCheckUtils]: 16: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,575 INFO L280 TraceCheckUtils]: 17: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,576 INFO L280 TraceCheckUtils]: 18: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume true; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,578 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2156#(<= 3 |dll_create_#in~len|)} {2120#(<= main_~len~0 2)} #92#return; {2116#false} is VALID [2020-07-10 15:10:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:23,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {2157#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-10 15:10:23,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-10 15:10:23,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#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); {2115#true} is VALID [2020-07-10 15:10:23,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:23,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-10 15:10:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:23,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {2157#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-10 15:10:23,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-10 15:10:23,629 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#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); {2115#true} is VALID [2020-07-10 15:10:23,629 INFO L280 TraceCheckUtils]: 3: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:23,630 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-10 15:10:23,631 INFO L263 TraceCheckUtils]: 0: Hoare triple {2115#true} call ULTIMATE.init(); {2151#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:10:23,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {2151#(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; {2115#true} is VALID [2020-07-10 15:10:23,632 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:23,632 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2115#true} {2115#true} #98#return; {2115#true} is VALID [2020-07-10 15:10:23,633 INFO L263 TraceCheckUtils]: 4: Hoare triple {2115#true} call #t~ret11 := main(); {2115#true} is VALID [2020-07-10 15:10:23,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {2115#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2120#(<= main_~len~0 2)} is VALID [2020-07-10 15:10:23,636 INFO L263 TraceCheckUtils]: 6: Hoare triple {2120#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2152#(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-10 15:10:23,637 INFO L280 TraceCheckUtils]: 7: Hoare triple {2152#(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; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,638 INFO L280 TraceCheckUtils]: 8: Hoare triple {2153#(= 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; {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,639 INFO L280 TraceCheckUtils]: 9: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,640 INFO L280 TraceCheckUtils]: 10: Hoare triple {2153#(= 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); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {2153#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2153#(= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {2153#(= 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; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,643 INFO L280 TraceCheckUtils]: 13: Hoare triple {2154#(<= (+ 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; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,644 INFO L280 TraceCheckUtils]: 14: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {2154#(<= (+ 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); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,646 INFO L280 TraceCheckUtils]: 16: Hoare triple {2154#(<= (+ 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); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,648 INFO L280 TraceCheckUtils]: 17: Hoare triple {2154#(<= (+ 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; {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,650 INFO L280 TraceCheckUtils]: 18: Hoare triple {2155#(<= (+ 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; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,652 INFO L280 TraceCheckUtils]: 20: Hoare triple {2156#(<= 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); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,653 INFO L280 TraceCheckUtils]: 21: Hoare triple {2156#(<= 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); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,654 INFO L280 TraceCheckUtils]: 22: Hoare triple {2156#(<= 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; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,656 INFO L280 TraceCheckUtils]: 24: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,657 INFO L280 TraceCheckUtils]: 25: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume true; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:23,659 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2156#(<= 3 |dll_create_#in~len|)} {2120#(<= main_~len~0 2)} #92#return; {2116#false} is VALID [2020-07-10 15:10:23,660 INFO L280 TraceCheckUtils]: 27: Hoare triple {2116#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; {2116#false} is VALID [2020-07-10 15:10:23,660 INFO L280 TraceCheckUtils]: 28: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-10 15:10:23,660 INFO L263 TraceCheckUtils]: 29: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2157#(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-10 15:10:23,661 INFO L280 TraceCheckUtils]: 30: Hoare triple {2157#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-10 15:10:23,661 INFO L280 TraceCheckUtils]: 31: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-10 15:10:23,661 INFO L280 TraceCheckUtils]: 32: Hoare triple {2115#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); {2115#true} is VALID [2020-07-10 15:10:23,662 INFO L280 TraceCheckUtils]: 33: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:23,662 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-10 15:10:23,662 INFO L280 TraceCheckUtils]: 35: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-10 15:10:23,663 INFO L280 TraceCheckUtils]: 36: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-10 15:10:23,663 INFO L263 TraceCheckUtils]: 37: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2157#(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-10 15:10:23,663 INFO L280 TraceCheckUtils]: 38: Hoare triple {2157#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2115#true} is VALID [2020-07-10 15:10:23,664 INFO L280 TraceCheckUtils]: 39: Hoare triple {2115#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2115#true} is VALID [2020-07-10 15:10:23,664 INFO L280 TraceCheckUtils]: 40: Hoare triple {2115#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); {2115#true} is VALID [2020-07-10 15:10:23,664 INFO L280 TraceCheckUtils]: 41: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:23,664 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2115#true} {2116#false} #94#return; {2116#false} is VALID [2020-07-10 15:10:23,665 INFO L280 TraceCheckUtils]: 43: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-10 15:10:23,665 INFO L280 TraceCheckUtils]: 44: Hoare triple {2116#false} assume !(~i~0 >= 0); {2116#false} is VALID [2020-07-10 15:10:23,665 INFO L280 TraceCheckUtils]: 45: Hoare triple {2116#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2116#false} is VALID [2020-07-10 15:10:23,666 INFO L280 TraceCheckUtils]: 46: Hoare triple {2116#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2116#false} is VALID [2020-07-10 15:10:23,666 INFO L280 TraceCheckUtils]: 47: Hoare triple {2116#false} assume !false; {2116#false} is VALID [2020-07-10 15:10:23,671 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-10 15:10:23,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172621190] [2020-07-10 15:10:23,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517100824] [2020-07-10 15:10:23,672 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-10 15:10:25,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 15:10:25,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:10:25,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:10:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:25,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:10:25,262 INFO L263 TraceCheckUtils]: 0: Hoare triple {2115#true} call ULTIMATE.init(); {2115#true} is VALID [2020-07-10 15:10:25,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {2115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2115#true} is VALID [2020-07-10 15:10:25,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {2115#true} assume true; {2115#true} is VALID [2020-07-10 15:10:25,263 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2115#true} {2115#true} #98#return; {2115#true} is VALID [2020-07-10 15:10:25,263 INFO L263 TraceCheckUtils]: 4: Hoare triple {2115#true} call #t~ret11 := main(); {2115#true} is VALID [2020-07-10 15:10:25,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {2115#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2120#(<= main_~len~0 2)} is VALID [2020-07-10 15:10:25,265 INFO L263 TraceCheckUtils]: 6: Hoare triple {2120#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2115#true} is VALID [2020-07-10 15:10:25,266 INFO L280 TraceCheckUtils]: 7: Hoare triple {2115#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {2182#(<= 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; {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {2182#(<= 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); {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {2182#(<= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2182#(<= dll_create_~len |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,272 INFO L280 TraceCheckUtils]: 12: Hoare triple {2182#(<= 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; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,273 INFO L280 TraceCheckUtils]: 13: Hoare triple {2154#(<= (+ 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; {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,274 INFO L280 TraceCheckUtils]: 14: Hoare triple {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,275 INFO L280 TraceCheckUtils]: 15: Hoare triple {2154#(<= (+ 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); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,276 INFO L280 TraceCheckUtils]: 16: Hoare triple {2154#(<= (+ 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); {2154#(<= (+ dll_create_~len 1) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,277 INFO L280 TraceCheckUtils]: 17: Hoare triple {2154#(<= (+ 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; {2155#(<= (+ dll_create_~len 2) |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,280 INFO L280 TraceCheckUtils]: 18: Hoare triple {2155#(<= (+ 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; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,281 INFO L280 TraceCheckUtils]: 19: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,282 INFO L280 TraceCheckUtils]: 20: Hoare triple {2156#(<= 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); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,283 INFO L280 TraceCheckUtils]: 21: Hoare triple {2156#(<= 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); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,284 INFO L280 TraceCheckUtils]: 22: Hoare triple {2156#(<= 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; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,285 INFO L280 TraceCheckUtils]: 23: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume !(~len > 0); {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,286 INFO L280 TraceCheckUtils]: 24: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,287 INFO L280 TraceCheckUtils]: 25: Hoare triple {2156#(<= 3 |dll_create_#in~len|)} assume true; {2156#(<= 3 |dll_create_#in~len|)} is VALID [2020-07-10 15:10:25,289 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2156#(<= 3 |dll_create_#in~len|)} {2120#(<= main_~len~0 2)} #92#return; {2116#false} is VALID [2020-07-10 15:10:25,289 INFO L280 TraceCheckUtils]: 27: Hoare triple {2116#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; {2116#false} is VALID [2020-07-10 15:10:25,290 INFO L280 TraceCheckUtils]: 28: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-10 15:10:25,290 INFO L263 TraceCheckUtils]: 29: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2116#false} is VALID [2020-07-10 15:10:25,290 INFO L280 TraceCheckUtils]: 30: Hoare triple {2116#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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2116#false} is VALID [2020-07-10 15:10:25,291 INFO L280 TraceCheckUtils]: 31: Hoare triple {2116#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2116#false} is VALID [2020-07-10 15:10:25,291 INFO L280 TraceCheckUtils]: 32: Hoare triple {2116#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); {2116#false} is VALID [2020-07-10 15:10:25,291 INFO L280 TraceCheckUtils]: 33: Hoare triple {2116#false} assume true; {2116#false} is VALID [2020-07-10 15:10:25,292 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2116#false} {2116#false} #94#return; {2116#false} is VALID [2020-07-10 15:10:25,292 INFO L280 TraceCheckUtils]: 35: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-10 15:10:25,292 INFO L280 TraceCheckUtils]: 36: Hoare triple {2116#false} assume !!(~i~0 >= 0); {2116#false} is VALID [2020-07-10 15:10:25,292 INFO L263 TraceCheckUtils]: 37: Hoare triple {2116#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2116#false} is VALID [2020-07-10 15:10:25,293 INFO L280 TraceCheckUtils]: 38: Hoare triple {2116#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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2116#false} is VALID [2020-07-10 15:10:25,293 INFO L280 TraceCheckUtils]: 39: Hoare triple {2116#false} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2116#false} is VALID [2020-07-10 15:10:25,293 INFO L280 TraceCheckUtils]: 40: Hoare triple {2116#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); {2116#false} is VALID [2020-07-10 15:10:25,293 INFO L280 TraceCheckUtils]: 41: Hoare triple {2116#false} assume true; {2116#false} is VALID [2020-07-10 15:10:25,293 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2116#false} {2116#false} #94#return; {2116#false} is VALID [2020-07-10 15:10:25,294 INFO L280 TraceCheckUtils]: 43: Hoare triple {2116#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2116#false} is VALID [2020-07-10 15:10:25,294 INFO L280 TraceCheckUtils]: 44: Hoare triple {2116#false} assume !(~i~0 >= 0); {2116#false} is VALID [2020-07-10 15:10:25,294 INFO L280 TraceCheckUtils]: 45: Hoare triple {2116#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2116#false} is VALID [2020-07-10 15:10:25,294 INFO L280 TraceCheckUtils]: 46: Hoare triple {2116#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2116#false} is VALID [2020-07-10 15:10:25,294 INFO L280 TraceCheckUtils]: 47: Hoare triple {2116#false} assume !false; {2116#false} is VALID [2020-07-10 15:10:25,296 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-10 15:10:25,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:10:25,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2020-07-10 15:10:25,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268833548] [2020-07-10 15:10:25,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-10 15:10:25,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:10:25,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:10:25,426 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-10 15:10:25,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:10:25,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:10:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:10:25,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:10:25,427 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 11 states. [2020-07-10 15:10:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:26,909 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2020-07-10 15:10:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:10:26,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-10 15:10:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:10:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:10:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2020-07-10 15:10:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:10:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2020-07-10 15:10:26,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2020-07-10 15:10:27,114 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-10 15:10:27,115 INFO L225 Difference]: With dead ends: 73 [2020-07-10 15:10:27,116 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 15:10:27,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:10:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 15:10:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-10 15:10:27,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:10:27,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-10 15:10:27,227 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-10 15:10:27,227 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-10 15:10:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:27,230 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:10:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:10:27,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:27,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:27,232 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-10 15:10:27,232 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-10 15:10:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:27,236 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:10:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:10:27,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:27,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:27,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:10:27,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:10:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:10:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2020-07-10 15:10:27,240 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 48 [2020-07-10 15:10:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:10:27,240 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-07-10 15:10:27,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:10:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2020-07-10 15:10:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:10:27,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:10:27,242 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-10 15:10:27,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:10:27,457 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:10:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:10:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2096610473, now seen corresponding path program 1 times [2020-07-10 15:10:27,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:10:27,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820173903] [2020-07-10 15:10:27,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:10:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:27,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {2600#(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; {2561#true} is VALID [2020-07-10 15:10:27,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,553 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2561#true} {2561#true} #98#return; {2561#true} is VALID [2020-07-10 15:10:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:27,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {2601#(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; {2561#true} is VALID [2020-07-10 15:10:27,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-10 15:10:27,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {2561#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2561#true} is VALID [2020-07-10 15:10:27,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,589 INFO L280 TraceCheckUtils]: 6: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-10 15:10:27,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {2561#true} assume !(~len > 0); {2561#true} is VALID [2020-07-10 15:10:27,590 INFO L280 TraceCheckUtils]: 12: Hoare triple {2561#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2561#true} is VALID [2020-07-10 15:10:27,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,592 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2561#true} {2566#(<= main_~len~0 2)} #92#return; {2566#(<= main_~len~0 2)} is VALID [2020-07-10 15:10:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:27,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-10 15:10:27,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-10 15:10:27,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2561#true} {2582#(<= main_~i~0 1)} #94#return; {2582#(<= main_~i~0 1)} is VALID [2020-07-10 15:10:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:27,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-10 15:10:27,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {2561#true} is VALID [2020-07-10 15:10:27,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,628 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,629 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2561#true} {2588#(<= main_~i~0 0)} #94#return; {2588#(<= main_~i~0 0)} is VALID [2020-07-10 15:10:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:10:27,636 INFO L280 TraceCheckUtils]: 0: Hoare triple {2602#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-10 15:10:27,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-10 15:10:27,636 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,636 INFO L280 TraceCheckUtils]: 3: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,637 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2561#true} {2562#false} #94#return; {2562#false} is VALID [2020-07-10 15:10:27,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {2561#true} call ULTIMATE.init(); {2600#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:10:27,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {2600#(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; {2561#true} is VALID [2020-07-10 15:10:27,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,638 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2561#true} {2561#true} #98#return; {2561#true} is VALID [2020-07-10 15:10:27,639 INFO L263 TraceCheckUtils]: 4: Hoare triple {2561#true} call #t~ret11 := main(); {2561#true} is VALID [2020-07-10 15:10:27,640 INFO L280 TraceCheckUtils]: 5: Hoare triple {2561#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.allocOnStack(4); {2566#(<= main_~len~0 2)} is VALID [2020-07-10 15:10:27,641 INFO L263 TraceCheckUtils]: 6: Hoare triple {2566#(<= main_~len~0 2)} call #t~ret8.base, #t~ret8.offset := dll_create(~len~0, ~data~0); {2601#(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-10 15:10:27,641 INFO L280 TraceCheckUtils]: 7: Hoare triple {2601#(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; {2561#true} is VALID [2020-07-10 15:10:27,641 INFO L280 TraceCheckUtils]: 8: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-10 15:10:27,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {2561#true} assume !(~head~0.base != 0 || ~head~0.offset != 0); {2561#true} is VALID [2020-07-10 15:10:27,642 INFO L280 TraceCheckUtils]: 12: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {2561#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2561#true} is VALID [2020-07-10 15:10:27,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {2561#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; {2561#true} is VALID [2020-07-10 15:10:27,643 INFO L280 TraceCheckUtils]: 18: Hoare triple {2561#true} assume !(~len > 0); {2561#true} is VALID [2020-07-10 15:10:27,643 INFO L280 TraceCheckUtils]: 19: Hoare triple {2561#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2561#true} is VALID [2020-07-10 15:10:27,643 INFO L280 TraceCheckUtils]: 20: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,645 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2561#true} {2566#(<= main_~len~0 2)} #92#return; {2566#(<= main_~len~0 2)} is VALID [2020-07-10 15:10:27,646 INFO L280 TraceCheckUtils]: 22: Hoare triple {2566#(<= 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; {2582#(<= main_~i~0 1)} is VALID [2020-07-10 15:10:27,647 INFO L280 TraceCheckUtils]: 23: Hoare triple {2582#(<= main_~i~0 1)} assume !!(~i~0 >= 0); {2582#(<= main_~i~0 1)} is VALID [2020-07-10 15:10:27,648 INFO L263 TraceCheckUtils]: 24: Hoare triple {2582#(<= main_~i~0 1)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2602#(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-10 15:10:27,648 INFO L280 TraceCheckUtils]: 25: Hoare triple {2602#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-10 15:10:27,648 INFO L280 TraceCheckUtils]: 26: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-10 15:10:27,649 INFO L280 TraceCheckUtils]: 27: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,649 INFO L280 TraceCheckUtils]: 28: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,650 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {2561#true} {2582#(<= main_~i~0 1)} #94#return; {2582#(<= main_~i~0 1)} is VALID [2020-07-10 15:10:27,651 INFO L280 TraceCheckUtils]: 30: Hoare triple {2582#(<= main_~i~0 1)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2588#(<= main_~i~0 0)} is VALID [2020-07-10 15:10:27,651 INFO L280 TraceCheckUtils]: 31: Hoare triple {2588#(<= main_~i~0 0)} assume !!(~i~0 >= 0); {2588#(<= main_~i~0 0)} is VALID [2020-07-10 15:10:27,653 INFO L263 TraceCheckUtils]: 32: Hoare triple {2588#(<= main_~i~0 0)} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2602#(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-10 15:10:27,653 INFO L280 TraceCheckUtils]: 33: Hoare triple {2602#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-10 15:10:27,654 INFO L280 TraceCheckUtils]: 34: Hoare triple {2561#true} assume !(~temp~1.base != 0 || ~temp~1.offset != 0); {2561#true} is VALID [2020-07-10 15:10:27,654 INFO L280 TraceCheckUtils]: 35: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,654 INFO L280 TraceCheckUtils]: 36: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,655 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2561#true} {2588#(<= main_~i~0 0)} #94#return; {2588#(<= main_~i~0 0)} is VALID [2020-07-10 15:10:27,656 INFO L280 TraceCheckUtils]: 38: Hoare triple {2588#(<= main_~i~0 0)} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2594#(<= (+ main_~i~0 1) 0)} is VALID [2020-07-10 15:10:27,657 INFO L280 TraceCheckUtils]: 39: Hoare triple {2594#(<= (+ main_~i~0 1) 0)} assume !!(~i~0 >= 0); {2562#false} is VALID [2020-07-10 15:10:27,657 INFO L263 TraceCheckUtils]: 40: Hoare triple {2562#false} call dll_remove_first(~#s~0.base, ~#s~0.offset); {2602#(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-10 15:10:27,658 INFO L280 TraceCheckUtils]: 41: Hoare triple {2602#(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~mem5.base, #t~mem5.offset;havoc #t~mem6.base, #t~mem6.offset; {2561#true} is VALID [2020-07-10 15:10:27,658 INFO L280 TraceCheckUtils]: 42: Hoare triple {2561#true} assume ~temp~1.base != 0 || ~temp~1.offset != 0;call write~$Pointer$(0, 0, ~temp~1.base, 8 + ~temp~1.offset, 4); {2561#true} is VALID [2020-07-10 15:10:27,658 INFO L280 TraceCheckUtils]: 43: Hoare triple {2561#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); {2561#true} is VALID [2020-07-10 15:10:27,658 INFO L280 TraceCheckUtils]: 44: Hoare triple {2561#true} assume true; {2561#true} is VALID [2020-07-10 15:10:27,658 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2561#true} {2562#false} #94#return; {2562#false} is VALID [2020-07-10 15:10:27,658 INFO L280 TraceCheckUtils]: 46: Hoare triple {2562#false} #t~post9 := ~i~0;~i~0 := #t~post9 - 1;havoc #t~post9; {2562#false} is VALID [2020-07-10 15:10:27,659 INFO L280 TraceCheckUtils]: 47: Hoare triple {2562#false} assume !(~i~0 >= 0); {2562#false} is VALID [2020-07-10 15:10:27,659 INFO L280 TraceCheckUtils]: 48: Hoare triple {2562#false} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4); {2562#false} is VALID [2020-07-10 15:10:27,659 INFO L280 TraceCheckUtils]: 49: Hoare triple {2562#false} assume 0 != #t~mem10.base || 0 != #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2562#false} is VALID [2020-07-10 15:10:27,659 INFO L280 TraceCheckUtils]: 50: Hoare triple {2562#false} assume !false; {2562#false} is VALID [2020-07-10 15:10:27,662 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-10 15:10:27,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820173903] [2020-07-10 15:10:27,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:10:27,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 15:10:27,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138628914] [2020-07-10 15:10:27,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-10 15:10:27,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:10:27,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:10:27,727 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-10 15:10:27,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:10:27,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:10:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:10:27,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:10:27,728 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 9 states. [2020-07-10 15:10:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:28,296 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-10 15:10:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:10:28,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-10 15:10:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:10:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:10:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-10 15:10:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:10:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2020-07-10 15:10:28,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2020-07-10 15:10:28,387 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-10 15:10:28,388 INFO L225 Difference]: With dead ends: 53 [2020-07-10 15:10:28,388 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:10:28,389 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-10 15:10:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:10:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:10:28,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:10:28,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:28,389 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:28,390 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:28,390 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:10:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:10:28,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:28,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:28,390 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:28,390 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:10:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:10:28,391 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:10:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:10:28,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:28,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:10:28,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:10:28,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:10:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:10:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:10:28,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-10 15:10:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:10:28,391 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:10:28,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:10:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:10:28,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:10:28,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:10:28,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:10:28,706 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 42 [2020-07-10 15:10:29,049 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2020-07-10 15:10:29,243 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 47 [2020-07-10 15:10:29,327 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:10:29,328 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-10 15:10:29,328 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:10:29,328 INFO L271 CegarLoopResult]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2020-07-10 15:10:29,328 INFO L268 CegarLoopResult]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2020-07-10 15:10:29,328 INFO L271 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: true [2020-07-10 15:10:29,328 INFO L268 CegarLoopResult]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2020-07-10 15:10:29,328 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-10 15:10:29,329 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-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2020-07-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2020-07-10 15:10:29,329 INFO L271 CegarLoopResult]: At program point L579(line 579) the Hoare annotation is: true [2020-07-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2020-07-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point L584(lines 584 586) no Hoare annotation was computed. [2020-07-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2020-07-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point L578(lines 578 580) no Hoare annotation was computed. [2020-07-10 15:10:29,329 INFO L268 CegarLoopResult]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:10:29,330 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:10:29,330 INFO L264 CegarLoopResult]: At program point L609(lines 600 614) the Hoare annotation is: false [2020-07-10 15:10:29,330 INFO L268 CegarLoopResult]: For program point L608(lines 608 610) no Hoare annotation was computed. [2020-07-10 15:10:29,331 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 612) no Hoare annotation was computed. [2020-07-10 15:10:29,331 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-10 15:10:29,331 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-10 15:10:29,331 INFO L268 CegarLoopResult]: For program point L606-1(lines 605 607) no Hoare annotation was computed. [2020-07-10 15:10:29,331 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-10 15:10:29,331 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-10 15:10:29,331 INFO L268 CegarLoopResult]: For program point L603-1(line 603) no Hoare annotation was computed. [2020-07-10 15:10:29,331 INFO L268 CegarLoopResult]: For program point L605-3(lines 605 607) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 600 614) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 600 614) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point L567(line 567) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point L566(lines 566 568) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2020-07-10 15:10:29,332 INFO L268 CegarLoopResult]: For program point L594-2(lines 594 596) no Hoare annotation was computed. [2020-07-10 15:10:29,333 INFO L268 CegarLoopResult]: For program point dll_remove_firstFINAL(lines 592 599) no Hoare annotation was computed. [2020-07-10 15:10:29,333 INFO L268 CegarLoopResult]: For program point dll_remove_firstEXIT(lines 592 599) no Hoare annotation was computed. [2020-07-10 15:10:29,333 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-10 15:10:29,333 INFO L268 CegarLoopResult]: For program point L594(lines 594 596) no Hoare annotation was computed. [2020-07-10 15:10:29,337 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:10:29,339 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:10:29,340 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: node_createENTRY has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-10 15:10:29,341 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:10:29,342 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:10:29,343 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:10:29,343 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-10 15:10:29,344 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-10 15:10:29,344 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L603-1 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2020-07-10 15:10:29,345 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-10 15:10:29,346 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-10 15:10:29,346 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-10 15:10:29,346 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-10 15:10:29,347 WARN L170 areAnnotationChecker]: node_createFINAL has no Hoare annotation [2020-07-10 15:10:29,347 WARN L170 areAnnotationChecker]: dll_remove_firstFINAL has no Hoare annotation [2020-07-10 15:10:29,347 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2020-07-10 15:10:29,347 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-10 15:10:29,347 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-10 15:10:29,347 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-10 15:10:29,348 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-10 15:10:29,349 WARN L170 areAnnotationChecker]: dll_remove_firstEXIT has no Hoare annotation [2020-07-10 15:10:29,349 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2020-07-10 15:10:29,349 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-10 15:10:29,350 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-10 15:10:29,350 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-10 15:10:29,350 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:10:29,350 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:10:29,350 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:10:29,350 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:10:29,350 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-10 15:10:29,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,366 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,367 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,367 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,367 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,369 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,369 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,369 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,375 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,378 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,381 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,382 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,382 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,382 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,383 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,384 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,385 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,386 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,387 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,387 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,387 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,388 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,388 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,389 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,390 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,391 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,392 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,393 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,393 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,393 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,393 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,394 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,395 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,400 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,400 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,401 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,401 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,401 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,401 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,402 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,403 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,404 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,404 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,404 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,408 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,408 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,408 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,408 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,409 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,409 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,409 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,410 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,411 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,412 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,413 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,414 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,415 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,416 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:10:29 BoogieIcfgContainer [2020-07-10 15:10:29,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:10:29,423 INFO L168 Benchmark]: Toolchain (without parser) took 58868.02 ms. Allocated memory was 137.4 MB in the beginning and 581.4 MB in the end (delta: 444.1 MB). Free memory was 100.5 MB in the beginning and 211.5 MB in the end (delta: -110.9 MB). Peak memory consumption was 333.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:29,424 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 15:10:29,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.24 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 168.1 MB in the end (delta: -68.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:29,425 INFO L168 Benchmark]: Boogie Preprocessor took 71.11 ms. Allocated memory is still 202.4 MB. Free memory was 168.1 MB in the beginning and 164.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:29,425 INFO L168 Benchmark]: RCFGBuilder took 740.25 ms. Allocated memory is still 202.4 MB. Free memory was 164.3 MB in the beginning and 105.5 MB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:29,426 INFO L168 Benchmark]: TraceAbstraction took 57455.82 ms. Allocated memory was 202.4 MB in the beginning and 581.4 MB in the end (delta: 379.1 MB). Free memory was 105.5 MB in the beginning and 211.5 MB in the end (delta: -106.0 MB). Peak memory consumption was 273.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:10:29,428 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 595.24 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 168.1 MB in the end (delta: -68.0 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.11 ms. Allocated memory is still 202.4 MB. Free memory was 168.1 MB in the beginning and 164.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 740.25 ms. Allocated memory is still 202.4 MB. Free memory was 164.3 MB in the beginning and 105.5 MB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57455.82 ms. Allocated memory was 202.4 MB in the beginning and 581.4 MB in the end (delta: 379.1 MB). Free memory was 105.5 MB in the beginning and 211.5 MB in the end (delta: -106.0 MB). Peak memory consumption was 273.1 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-10 15:10:29,441 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,442 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,443 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,444 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,445 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,446 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,447 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,454 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,455 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,456 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,457 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,458 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,459 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-10 15:10:29,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,460 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:10:29,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,461 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,462 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,463 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,464 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,465 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,465 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-10 15:10:29,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,466 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,467 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,468 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,469 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,470 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,470 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,470 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,471 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,472 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,473 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,475 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,475 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,475 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,475 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,475 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,476 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,477 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:10:29,478 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:10:29,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,480 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-10 15:10:29,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,482 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:10:29,482 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: 56.3s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 227 SDtfs, 212 SDslu, 1072 SDs, 0 SdLazy, 2071 SolverSat, 146 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 8.9s 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.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 417 ConstructedInterpolants, 3 QuantifiedInterpolants, 197195 SizeOfPredicates, 33 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 89/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...