java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:35:28,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:35:28,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:35:28,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:35:28,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:35:28,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:35:28,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:35:28,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:35:28,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:35:28,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:35:28,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:35:28,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:35:28,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:35:28,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:35:28,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:35:28,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:35:28,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:35:28,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:35:28,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:35:28,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:35:28,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:35:28,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:35:28,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:35:28,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:35:28,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:35:28,610 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:35:28,611 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:35:28,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:35:28,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:35:28,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:35:28,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:35:28,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:35:28,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:35:28,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:35:28,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:35:28,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:35:28,619 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:35:28,636 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:35:28,636 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:35:28,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:35:28,640 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:35:28,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:35:28,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:35:28,641 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:35:28,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:35:28,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:35:28,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:35:28,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:35:28,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:35:28,644 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:35:28,644 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:35:28,644 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:35:28,644 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:35:28,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:35:28,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:35:28,646 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:35:28,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:35:28,646 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:35:28,646 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:35:28,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:35:28,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:35:28,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:35:28,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:35:28,648 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:35:28,648 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:35:28,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:35:28,648 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:35:28,648 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:35:28,648 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:35:28,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:35:28,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:35:28,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:35:28,719 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:35:28,719 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:35:28,720 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i [2018-11-14 16:35:28,779 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24448bbb/5c5ea89ec4cd4538bb2a689d21d01f76/FLAGd40f6d7d0 [2018-11-14 16:35:29,354 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:35:29,355 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i [2018-11-14 16:35:29,370 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24448bbb/5c5ea89ec4cd4538bb2a689d21d01f76/FLAGd40f6d7d0 [2018-11-14 16:35:29,384 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f24448bbb/5c5ea89ec4cd4538bb2a689d21d01f76 [2018-11-14 16:35:29,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:35:29,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:35:29,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:29,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:35:29,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:35:29,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:29" (1/1) ... [2018-11-14 16:35:29,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4492c970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:29, skipping insertion in model container [2018-11-14 16:35:29,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:29" (1/1) ... [2018-11-14 16:35:29,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:35:29,463 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:35:29,907 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:29,920 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:35:30,033 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:30,183 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:35:30,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30 WrapperNode [2018-11-14 16:35:30,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:30,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:35:30,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:35:30,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:35:30,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (1/1) ... [2018-11-14 16:35:30,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:35:30,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:35:30,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:35:30,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:35:30,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (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 [2018-11-14 16:35:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:35:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:35:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:35:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:35:30,364 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:35:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 16:35:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2018-11-14 16:35:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-14 16:35:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-14 16:35:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2018-11-14 16:35:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:35:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:35:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:35:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:35:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:35:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:35:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:35:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:35:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:35:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:35:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:35:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:35:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:35:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:35:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:35:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:35:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:35:30,369 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:35:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:35:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:35:30,372 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:35:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:35:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:35:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:35:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:35:30,373 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:35:30,374 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:35:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:35:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:35:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:35:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:35:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:35:30,375 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:35:30,376 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:35:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:35:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:35:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:35:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:35:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:35:30,377 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:35:30,378 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:35:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:35:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:35:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:35:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:35:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:35:30,379 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:35:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:35:30,381 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:35:30,382 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2018-11-14 16:35:30,383 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-14 16:35:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:35:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-14 16:35:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2018-11-14 16:35:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:35:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:35:30,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:35:30,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:35:32,238 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:35:32,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:32 BoogieIcfgContainer [2018-11-14 16:35:32,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:35:32,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:35:32,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:35:32,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:35:32,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:35:29" (1/3) ... [2018-11-14 16:35:32,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af49d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:32, skipping insertion in model container [2018-11-14 16:35:32,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:30" (2/3) ... [2018-11-14 16:35:32,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af49d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:32, skipping insertion in model container [2018-11-14 16:35:32,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:32" (3/3) ... [2018-11-14 16:35:32,249 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i [2018-11-14 16:35:32,257 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:35:32,266 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:35:32,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:35:32,319 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:35:32,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:35:32,320 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:35:32,320 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:35:32,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:35:32,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:35:32,321 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:35:32,321 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:35:32,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:35:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-11-14 16:35:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:35:32,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:32,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:32,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:32,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:32,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1689452513, now seen corresponding path program 1 times [2018-11-14 16:35:32,368 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:32,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:32,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:32,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {80#true} call ULTIMATE.init(); {80#true} is VALID [2018-11-14 16:35:32,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {80#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {80#true} is VALID [2018-11-14 16:35:32,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {80#true} assume true; {80#true} is VALID [2018-11-14 16:35:32,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {80#true} {80#true} #221#return; {80#true} is VALID [2018-11-14 16:35:32,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {80#true} call #t~ret25 := main(); {80#true} is VALID [2018-11-14 16:35:32,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {80#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {80#true} is VALID [2018-11-14 16:35:32,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {80#true} assume !true; {81#false} is VALID [2018-11-14 16:35:32,724 INFO L256 TraceCheckUtils]: 7: Hoare triple {81#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {81#false} is VALID [2018-11-14 16:35:32,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {81#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {81#false} is VALID [2018-11-14 16:35:32,725 INFO L256 TraceCheckUtils]: 9: Hoare triple {81#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {81#false} is VALID [2018-11-14 16:35:32,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {81#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {81#false} is VALID [2018-11-14 16:35:32,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {81#false} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {81#false} is VALID [2018-11-14 16:35:32,726 INFO L256 TraceCheckUtils]: 12: Hoare triple {81#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {81#false} is VALID [2018-11-14 16:35:32,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {81#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {81#false} is VALID [2018-11-14 16:35:32,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {81#false} assume !true; {81#false} is VALID [2018-11-14 16:35:32,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {81#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {81#false} is VALID [2018-11-14 16:35:32,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {81#false} assume true; {81#false} is VALID [2018-11-14 16:35:32,728 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {81#false} {81#false} #209#return; {81#false} is VALID [2018-11-14 16:35:32,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {81#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {81#false} is VALID [2018-11-14 16:35:32,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {81#false} assume true; {81#false} is VALID [2018-11-14 16:35:32,730 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {81#false} {81#false} #219#return; {81#false} is VALID [2018-11-14 16:35:32,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {81#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {81#false} is VALID [2018-11-14 16:35:32,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {81#false} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {81#false} is VALID [2018-11-14 16:35:32,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {81#false} assume true; {81#false} is VALID [2018-11-14 16:35:32,731 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {81#false} {81#false} #213#return; {81#false} is VALID [2018-11-14 16:35:32,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {81#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {81#false} is VALID [2018-11-14 16:35:32,732 INFO L273 TraceCheckUtils]: 26: Hoare triple {81#false} assume true; {81#false} is VALID [2018-11-14 16:35:32,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {81#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {81#false} is VALID [2018-11-14 16:35:32,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {81#false} assume ~bvsgt32(~i~0, ~max~0); {81#false} is VALID [2018-11-14 16:35:32,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {81#false} assume !false; {81#false} is VALID [2018-11-14 16:35:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:32,740 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:32,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:32,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:35:32,763 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-14 16:35:32,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:32,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:35:33,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:35:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:35:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:35:33,037 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 2 states. [2018-11-14 16:35:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:33,655 INFO L93 Difference]: Finished difference Result 148 states and 202 transitions. [2018-11-14 16:35:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:35:33,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-14 16:35:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2018-11-14 16:35:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 202 transitions. [2018-11-14 16:35:33,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 202 transitions. [2018-11-14 16:35:34,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:34,296 INFO L225 Difference]: With dead ends: 148 [2018-11-14 16:35:34,296 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 16:35:34,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:35:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 16:35:34,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 16:35:34,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:34,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:34,366 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:34,366 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:34,374 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 16:35:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 16:35:34,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:34,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:34,376 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:34,376 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 16:35:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:34,383 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 16:35:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 16:35:34,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:34,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:34,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:34,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:35:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-14 16:35:34,391 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 30 [2018-11-14 16:35:34,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:34,392 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-14 16:35:34,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:35:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-11-14 16:35:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:35:34,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:34,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:34,394 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:34,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1463534664, now seen corresponding path program 1 times [2018-11-14 16:35:34,395 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:34,396 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:34,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:34,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:35,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2018-11-14 16:35:35,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {566#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {566#true} is VALID [2018-11-14 16:35:35,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {566#true} assume true; {566#true} is VALID [2018-11-14 16:35:35,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {566#true} {566#true} #221#return; {566#true} is VALID [2018-11-14 16:35:35,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {566#true} call #t~ret25 := main(); {566#true} is VALID [2018-11-14 16:35:35,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {566#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {586#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:35,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {586#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:35,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~max~0); {567#false} is VALID [2018-11-14 16:35:35,066 INFO L256 TraceCheckUtils]: 8: Hoare triple {567#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {567#false} is VALID [2018-11-14 16:35:35,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {567#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {567#false} is VALID [2018-11-14 16:35:35,067 INFO L256 TraceCheckUtils]: 10: Hoare triple {567#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {567#false} is VALID [2018-11-14 16:35:35,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {567#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {567#false} is VALID [2018-11-14 16:35:35,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {567#false} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {567#false} is VALID [2018-11-14 16:35:35,067 INFO L256 TraceCheckUtils]: 13: Hoare triple {567#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {567#false} is VALID [2018-11-14 16:35:35,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {567#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {567#false} is VALID [2018-11-14 16:35:35,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {567#false} assume true; {567#false} is VALID [2018-11-14 16:35:35,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {567#false} assume !~bvsgt32(~len, 0bv32); {567#false} is VALID [2018-11-14 16:35:35,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {567#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {567#false} is VALID [2018-11-14 16:35:35,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {567#false} assume true; {567#false} is VALID [2018-11-14 16:35:35,069 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {567#false} {567#false} #209#return; {567#false} is VALID [2018-11-14 16:35:35,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {567#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {567#false} is VALID [2018-11-14 16:35:35,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {567#false} assume true; {567#false} is VALID [2018-11-14 16:35:35,070 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {567#false} {567#false} #219#return; {567#false} is VALID [2018-11-14 16:35:35,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {567#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {567#false} is VALID [2018-11-14 16:35:35,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {567#false} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {567#false} is VALID [2018-11-14 16:35:35,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {567#false} assume true; {567#false} is VALID [2018-11-14 16:35:35,072 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {567#false} {567#false} #213#return; {567#false} is VALID [2018-11-14 16:35:35,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {567#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {567#false} is VALID [2018-11-14 16:35:35,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {567#false} assume true; {567#false} is VALID [2018-11-14 16:35:35,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {567#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {567#false} is VALID [2018-11-14 16:35:35,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {567#false} assume ~bvsgt32(~i~0, ~max~0); {567#false} is VALID [2018-11-14 16:35:35,073 INFO L273 TraceCheckUtils]: 31: Hoare triple {567#false} assume !false; {567#false} is VALID [2018-11-14 16:35:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:35,076 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:35,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:35:35,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 16:35:35,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:35,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:35:35,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:35,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:35:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:35:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:35:35,167 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 3 states. [2018-11-14 16:35:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:35,732 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2018-11-14 16:35:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:35:35,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 16:35:35,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:35:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-14 16:35:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:35:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-14 16:35:35,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-14 16:35:35,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:35,967 INFO L225 Difference]: With dead ends: 110 [2018-11-14 16:35:35,967 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 16:35:35,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:35:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 16:35:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-11-14 16:35:36,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:36,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 60 states. [2018-11-14 16:35:36,011 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 60 states. [2018-11-14 16:35:36,011 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 60 states. [2018-11-14 16:35:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:36,016 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2018-11-14 16:35:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-14 16:35:36,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:36,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:36,018 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 65 states. [2018-11-14 16:35:36,018 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 65 states. [2018-11-14 16:35:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:36,023 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2018-11-14 16:35:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-11-14 16:35:36,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:36,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:36,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:36,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 16:35:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-11-14 16:35:36,029 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 32 [2018-11-14 16:35:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:36,029 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-11-14 16:35:36,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:35:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-14 16:35:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:35:36,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:36,032 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:36,032 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:36,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:36,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1949798085, now seen corresponding path program 1 times [2018-11-14 16:35:36,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:36,033 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:36,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:36,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:36,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-14 16:35:36,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1024#true} is VALID [2018-11-14 16:35:36,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-14 16:35:36,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #221#return; {1024#true} is VALID [2018-11-14 16:35:36,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret25 := main(); {1024#true} is VALID [2018-11-14 16:35:36,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:36,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:36,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:36,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:36,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:36,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {1044#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1060#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:35:36,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {1060#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume true; {1060#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:35:36,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {1060#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume !~bvsle32(~i~0, ~max~0); {1025#false} is VALID [2018-11-14 16:35:36,258 INFO L256 TraceCheckUtils]: 13: Hoare triple {1025#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1025#false} is VALID [2018-11-14 16:35:36,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {1025#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1025#false} is VALID [2018-11-14 16:35:36,259 INFO L256 TraceCheckUtils]: 15: Hoare triple {1025#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1025#false} is VALID [2018-11-14 16:35:36,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {1025#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1025#false} is VALID [2018-11-14 16:35:36,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {1025#false} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {1025#false} is VALID [2018-11-14 16:35:36,261 INFO L256 TraceCheckUtils]: 18: Hoare triple {1025#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1025#false} is VALID [2018-11-14 16:35:36,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {1025#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1025#false} is VALID [2018-11-14 16:35:36,261 INFO L273 TraceCheckUtils]: 20: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-14 16:35:36,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {1025#false} assume !~bvsgt32(~len, 0bv32); {1025#false} is VALID [2018-11-14 16:35:36,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {1025#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1025#false} is VALID [2018-11-14 16:35:36,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-14 16:35:36,262 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1025#false} {1025#false} #209#return; {1025#false} is VALID [2018-11-14 16:35:36,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {1025#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1025#false} is VALID [2018-11-14 16:35:36,263 INFO L273 TraceCheckUtils]: 26: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-14 16:35:36,263 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1025#false} {1025#false} #219#return; {1025#false} is VALID [2018-11-14 16:35:36,264 INFO L273 TraceCheckUtils]: 28: Hoare triple {1025#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1025#false} is VALID [2018-11-14 16:35:36,264 INFO L273 TraceCheckUtils]: 29: Hoare triple {1025#false} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1025#false} is VALID [2018-11-14 16:35:36,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-14 16:35:36,264 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1025#false} {1025#false} #213#return; {1025#false} is VALID [2018-11-14 16:35:36,265 INFO L273 TraceCheckUtils]: 32: Hoare triple {1025#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {1025#false} is VALID [2018-11-14 16:35:36,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-14 16:35:36,265 INFO L273 TraceCheckUtils]: 34: Hoare triple {1025#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {1025#false} is VALID [2018-11-14 16:35:36,266 INFO L273 TraceCheckUtils]: 35: Hoare triple {1025#false} assume ~bvsgt32(~i~0, ~max~0); {1025#false} is VALID [2018-11-14 16:35:36,266 INFO L273 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-14 16:35:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:36,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:36,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-14 16:35:36,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {1025#false} assume ~bvsgt32(~i~0, ~max~0); {1025#false} is VALID [2018-11-14 16:35:36,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {1025#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {1025#false} is VALID [2018-11-14 16:35:36,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-14 16:35:36,536 INFO L273 TraceCheckUtils]: 32: Hoare triple {1025#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {1025#false} is VALID [2018-11-14 16:35:36,536 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1024#true} {1025#false} #213#return; {1025#false} is VALID [2018-11-14 16:35:36,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-14 16:35:36,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {1024#true} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1024#true} is VALID [2018-11-14 16:35:36,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {1024#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1024#true} is VALID [2018-11-14 16:35:36,538 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1024#true} {1024#true} #219#return; {1024#true} is VALID [2018-11-14 16:35:36,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-14 16:35:36,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {1024#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1024#true} is VALID [2018-11-14 16:35:36,539 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1024#true} {1024#true} #209#return; {1024#true} is VALID [2018-11-14 16:35:36,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-14 16:35:36,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {1024#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1024#true} is VALID [2018-11-14 16:35:36,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {1024#true} assume !~bvsgt32(~len, 0bv32); {1024#true} is VALID [2018-11-14 16:35:36,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-14 16:35:36,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {1024#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1024#true} is VALID [2018-11-14 16:35:36,541 INFO L256 TraceCheckUtils]: 18: Hoare triple {1024#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1024#true} is VALID [2018-11-14 16:35:36,541 INFO L273 TraceCheckUtils]: 17: Hoare triple {1024#true} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {1024#true} is VALID [2018-11-14 16:35:36,541 INFO L273 TraceCheckUtils]: 16: Hoare triple {1024#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1024#true} is VALID [2018-11-14 16:35:36,541 INFO L256 TraceCheckUtils]: 15: Hoare triple {1024#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1024#true} is VALID [2018-11-14 16:35:36,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {1024#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1024#true} is VALID [2018-11-14 16:35:36,542 INFO L256 TraceCheckUtils]: 13: Hoare triple {1025#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1024#true} is VALID [2018-11-14 16:35:36,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {1211#(bvsle main_~i~0 main_~max~0)} assume !~bvsle32(~i~0, ~max~0); {1025#false} is VALID [2018-11-14 16:35:36,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {1211#(bvsle main_~i~0 main_~max~0)} assume true; {1211#(bvsle main_~i~0 main_~max~0)} is VALID [2018-11-14 16:35:36,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1211#(bvsle main_~i~0 main_~max~0)} is VALID [2018-11-14 16:35:36,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 16:35:36,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume true; {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 16:35:36,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 16:35:36,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} assume true; {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 16:35:36,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {1218#(bvsle (bvadd main_~i~0 (_ bv1 32)) main_~max~0)} is VALID [2018-11-14 16:35:36,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret25 := main(); {1024#true} is VALID [2018-11-14 16:35:36,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #221#return; {1024#true} is VALID [2018-11-14 16:35:36,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-14 16:35:36,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1024#true} is VALID [2018-11-14 16:35:36,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-14 16:35:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:36,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:35:36,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-14 16:35:36,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:36,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:35:36,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:36,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:35:36,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:35:36,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:35:36,771 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 6 states. [2018-11-14 16:35:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:37,603 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2018-11-14 16:35:37,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:35:37,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-14 16:35:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:35:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 16:35:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:35:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 16:35:37,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2018-11-14 16:35:37,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:37,865 INFO L225 Difference]: With dead ends: 126 [2018-11-14 16:35:37,865 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 16:35:37,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:35:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 16:35:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-11-14 16:35:37,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:37,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 78 states. [2018-11-14 16:35:37,907 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 78 states. [2018-11-14 16:35:37,907 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 78 states. [2018-11-14 16:35:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:37,912 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2018-11-14 16:35:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2018-11-14 16:35:37,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:37,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:37,914 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 81 states. [2018-11-14 16:35:37,914 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 81 states. [2018-11-14 16:35:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:37,919 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2018-11-14 16:35:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2018-11-14 16:35:37,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:37,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:37,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:37,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 16:35:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2018-11-14 16:35:37,926 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 37 [2018-11-14 16:35:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:37,926 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2018-11-14 16:35:37,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:35:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2018-11-14 16:35:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 16:35:37,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:37,928 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:37,928 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:37,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:37,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1638677851, now seen corresponding path program 2 times [2018-11-14 16:35:37,929 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:37,929 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:37,962 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:35:38,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:35:38,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:38,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:38,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2018-11-14 16:35:38,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1692#true} is VALID [2018-11-14 16:35:38,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2018-11-14 16:35:38,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #221#return; {1692#true} is VALID [2018-11-14 16:35:38,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret25 := main(); {1692#true} is VALID [2018-11-14 16:35:38,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {1692#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,336 INFO L273 TraceCheckUtils]: 13: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsle32(~i~0, ~max~0); {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:38,343 INFO L256 TraceCheckUtils]: 23: Hoare triple {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1692#true} is VALID [2018-11-14 16:35:38,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {1692#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1770#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-14 16:35:38,344 INFO L256 TraceCheckUtils]: 25: Hoare triple {1770#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1692#true} is VALID [2018-11-14 16:35:38,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {1692#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1777#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:35:38,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {1777#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {1777#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:35:38,346 INFO L256 TraceCheckUtils]: 28: Hoare triple {1777#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1692#true} is VALID [2018-11-14 16:35:38,347 INFO L273 TraceCheckUtils]: 29: Hoare triple {1692#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1787#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:38,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {1787#(= |sll_create_#in~len| sll_create_~len)} assume true; {1787#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:38,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {1787#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {1794#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {1794#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1794#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {1794#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {1794#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,353 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1794#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {1777#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #209#return; {1804#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,353 INFO L273 TraceCheckUtils]: 35: Hoare triple {1804#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1804#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {1804#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} assume true; {1804#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,355 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1804#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} {1770#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #219#return; {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume true; {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:35:38,369 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1814#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} {1712#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #213#return; {1693#false} is VALID [2018-11-14 16:35:38,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {1693#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {1693#false} is VALID [2018-11-14 16:35:38,369 INFO L273 TraceCheckUtils]: 43: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 16:35:38,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {1693#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {1693#false} is VALID [2018-11-14 16:35:38,370 INFO L273 TraceCheckUtils]: 45: Hoare triple {1693#false} assume ~bvsgt32(~i~0, ~max~0); {1693#false} is VALID [2018-11-14 16:35:38,370 INFO L273 TraceCheckUtils]: 46: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2018-11-14 16:35:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 16:35:38,375 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:38,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:38,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:35:38,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-14 16:35:38,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:38,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:38,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:38,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:38,466 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand 9 states. [2018-11-14 16:35:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:39,854 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2018-11-14 16:35:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:35:39,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-11-14 16:35:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2018-11-14 16:35:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2018-11-14 16:35:39,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 116 transitions. [2018-11-14 16:35:40,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:40,161 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:35:40,161 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 16:35:40,162 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:35:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 16:35:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-14 16:35:40,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:40,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-14 16:35:40,257 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-14 16:35:40,257 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-14 16:35:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:40,262 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-14 16:35:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-14 16:35:40,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:40,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:40,263 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-14 16:35:40,263 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-14 16:35:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:40,273 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-14 16:35:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-14 16:35:40,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:40,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:40,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:40,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:35:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-14 16:35:40,284 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 47 [2018-11-14 16:35:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-14 16:35:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:35:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-14 16:35:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 16:35:40,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:40,287 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:40,287 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:40,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1213057901, now seen corresponding path program 1 times [2018-11-14 16:35:40,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:40,288 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:40,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:35:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:40,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:40,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2018-11-14 16:35:40,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {2322#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2322#true} is VALID [2018-11-14 16:35:40,866 INFO L273 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2018-11-14 16:35:40,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #221#return; {2322#true} is VALID [2018-11-14 16:35:40,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret25 := main(); {2322#true} is VALID [2018-11-14 16:35:40,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {2322#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsle32(~i~0, ~max~0); {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:40,925 INFO L256 TraceCheckUtils]: 23: Hoare triple {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {2322#true} is VALID [2018-11-14 16:35:40,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {2400#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-14 16:35:40,926 INFO L256 TraceCheckUtils]: 25: Hoare triple {2400#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {2322#true} is VALID [2018-11-14 16:35:40,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {2407#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:35:40,928 INFO L273 TraceCheckUtils]: 27: Hoare triple {2407#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {2407#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:35:40,928 INFO L256 TraceCheckUtils]: 28: Hoare triple {2407#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {2322#true} is VALID [2018-11-14 16:35:40,929 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2417#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:40,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {2417#(= |sll_create_#in~len| sll_create_~len)} assume true; {2417#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:40,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {2417#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2417#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:40,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {2417#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2417#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:40,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {2417#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2430#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:40,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {2430#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {2430#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:40,934 INFO L273 TraceCheckUtils]: 35: Hoare triple {2430#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,935 INFO L273 TraceCheckUtils]: 36: Hoare triple {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,935 INFO L273 TraceCheckUtils]: 37: Hoare triple {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,937 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2407#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #209#return; {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,937 INFO L273 TraceCheckUtils]: 39: Hoare triple {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,940 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {2400#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #219#return; {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:40,943 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {2342#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #213#return; {2323#false} is VALID [2018-11-14 16:35:40,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {2323#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {2323#false} is VALID [2018-11-14 16:35:40,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {2323#false} assume true; {2323#false} is VALID [2018-11-14 16:35:40,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {2323#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {2323#false} is VALID [2018-11-14 16:35:40,944 INFO L273 TraceCheckUtils]: 49: Hoare triple {2323#false} assume ~bvsgt32(~i~0, ~max~0); {2323#false} is VALID [2018-11-14 16:35:40,944 INFO L273 TraceCheckUtils]: 50: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2018-11-14 16:35:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 16:35:40,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:41,911 INFO L273 TraceCheckUtils]: 50: Hoare triple {2323#false} assume !false; {2323#false} is VALID [2018-11-14 16:35:41,911 INFO L273 TraceCheckUtils]: 49: Hoare triple {2323#false} assume ~bvsgt32(~i~0, ~max~0); {2323#false} is VALID [2018-11-14 16:35:41,911 INFO L273 TraceCheckUtils]: 48: Hoare triple {2323#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {2323#false} is VALID [2018-11-14 16:35:41,911 INFO L273 TraceCheckUtils]: 47: Hoare triple {2323#false} assume true; {2323#false} is VALID [2018-11-14 16:35:41,912 INFO L273 TraceCheckUtils]: 46: Hoare triple {2323#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {2323#false} is VALID [2018-11-14 16:35:41,913 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} #213#return; {2323#false} is VALID [2018-11-14 16:35:41,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,919 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} {2516#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))))} #219#return; {2457#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,919 INFO L273 TraceCheckUtils]: 40: Hoare triple {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,920 INFO L273 TraceCheckUtils]: 39: Hoare triple {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,927 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2529#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} #209#return; {2447#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,928 INFO L273 TraceCheckUtils]: 37: Hoare triple {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,929 INFO L273 TraceCheckUtils]: 35: Hoare triple {2542#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {2437#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,929 INFO L273 TraceCheckUtils]: 34: Hoare triple {2542#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {2542#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:35:41,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2542#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:35:41,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {2322#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2549#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,943 INFO L256 TraceCheckUtils]: 28: Hoare triple {2529#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {2322#true} is VALID [2018-11-14 16:35:41,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {2529#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {2529#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {2322#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {2529#(or (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:41,945 INFO L256 TraceCheckUtils]: 25: Hoare triple {2516#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {2322#true} is VALID [2018-11-14 16:35:41,946 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {2516#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:41,946 INFO L256 TraceCheckUtils]: 23: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {2322#true} is VALID [2018-11-14 16:35:41,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsle32(~i~0, ~max~0); {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {2322#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {2500#(bvsgt (bvadd main_~min~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:41,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {2322#true} call #t~ret25 := main(); {2322#true} is VALID [2018-11-14 16:35:41,957 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2322#true} {2322#true} #221#return; {2322#true} is VALID [2018-11-14 16:35:41,957 INFO L273 TraceCheckUtils]: 2: Hoare triple {2322#true} assume true; {2322#true} is VALID [2018-11-14 16:35:41,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {2322#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2322#true} is VALID [2018-11-14 16:35:41,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {2322#true} call ULTIMATE.init(); {2322#true} is VALID [2018-11-14 16:35:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 16:35:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-11-14 16:35:41,967 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-11-14 16:35:41,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:41,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:35:42,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:35:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:35:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:35:42,100 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 15 states. [2018-11-14 16:35:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:44,978 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2018-11-14 16:35:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:35:44,978 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-11-14 16:35:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:35:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-14 16:35:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:35:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-14 16:35:44,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 124 transitions. [2018-11-14 16:35:45,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:45,252 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:35:45,252 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 16:35:45,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:35:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 16:35:45,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-11-14 16:35:45,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:45,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2018-11-14 16:35:45,304 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2018-11-14 16:35:45,304 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2018-11-14 16:35:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:45,309 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 16:35:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 16:35:45,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:45,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:45,310 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2018-11-14 16:35:45,310 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2018-11-14 16:35:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:45,315 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 16:35:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 16:35:45,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:45,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:45,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:45,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:35:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-14 16:35:45,321 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 51 [2018-11-14 16:35:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:45,321 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-14 16:35:45,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:35:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 16:35:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 16:35:45,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:45,322 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:45,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:45,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash 519688139, now seen corresponding path program 2 times [2018-11-14 16:35:45,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:45,324 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:45,351 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:35:45,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:35:45,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:45,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:45,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {3186#true} call ULTIMATE.init(); {3186#true} is VALID [2018-11-14 16:35:45,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {3186#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3186#true} is VALID [2018-11-14 16:35:45,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,687 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3186#true} {3186#true} #221#return; {3186#true} is VALID [2018-11-14 16:35:45,687 INFO L256 TraceCheckUtils]: 4: Hoare triple {3186#true} call #t~ret25 := main(); {3186#true} is VALID [2018-11-14 16:35:45,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {3186#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvsle32(~i~0, ~max~0); {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,699 INFO L256 TraceCheckUtils]: 23: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {3186#true} is VALID [2018-11-14 16:35:45,699 INFO L273 TraceCheckUtils]: 24: Hoare triple {3186#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3186#true} is VALID [2018-11-14 16:35:45,700 INFO L256 TraceCheckUtils]: 25: Hoare triple {3186#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3186#true} is VALID [2018-11-14 16:35:45,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {3186#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3186#true} is VALID [2018-11-14 16:35:45,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {3186#true} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {3186#true} is VALID [2018-11-14 16:35:45,701 INFO L256 TraceCheckUtils]: 28: Hoare triple {3186#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3186#true} is VALID [2018-11-14 16:35:45,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {3186#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3186#true} is VALID [2018-11-14 16:35:45,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {3186#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3186#true} is VALID [2018-11-14 16:35:45,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {3186#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3186#true} is VALID [2018-11-14 16:35:45,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {3186#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3186#true} is VALID [2018-11-14 16:35:45,703 INFO L273 TraceCheckUtils]: 34: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {3186#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3186#true} is VALID [2018-11-14 16:35:45,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {3186#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3186#true} is VALID [2018-11-14 16:35:45,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {3186#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3186#true} is VALID [2018-11-14 16:35:45,704 INFO L273 TraceCheckUtils]: 38: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,704 INFO L273 TraceCheckUtils]: 39: Hoare triple {3186#true} assume !~bvsgt32(~len, 0bv32); {3186#true} is VALID [2018-11-14 16:35:45,704 INFO L273 TraceCheckUtils]: 40: Hoare triple {3186#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3186#true} is VALID [2018-11-14 16:35:45,704 INFO L273 TraceCheckUtils]: 41: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,704 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3186#true} {3186#true} #209#return; {3186#true} is VALID [2018-11-14 16:35:45,705 INFO L273 TraceCheckUtils]: 43: Hoare triple {3186#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3186#true} is VALID [2018-11-14 16:35:45,705 INFO L273 TraceCheckUtils]: 44: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,705 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3186#true} {3186#true} #219#return; {3186#true} is VALID [2018-11-14 16:35:45,705 INFO L273 TraceCheckUtils]: 46: Hoare triple {3186#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3186#true} is VALID [2018-11-14 16:35:45,705 INFO L273 TraceCheckUtils]: 47: Hoare triple {3186#true} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {3186#true} is VALID [2018-11-14 16:35:45,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {3186#true} assume true; {3186#true} is VALID [2018-11-14 16:35:45,710 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3186#true} {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} #213#return; {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,711 INFO L273 TraceCheckUtils]: 50: Hoare triple {3206#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {3342#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,711 INFO L273 TraceCheckUtils]: 51: Hoare triple {3342#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {3342#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,712 INFO L273 TraceCheckUtils]: 52: Hoare triple {3342#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {3342#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:45,712 INFO L273 TraceCheckUtils]: 53: Hoare triple {3342#(and (= (bvadd main_~max~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume ~bvsgt32(~i~0, ~max~0); {3187#false} is VALID [2018-11-14 16:35:45,713 INFO L273 TraceCheckUtils]: 54: Hoare triple {3187#false} assume !false; {3187#false} is VALID [2018-11-14 16:35:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-14 16:35:45,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:45,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:45,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:35:45,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-14 16:35:45,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:45,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:35:45,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:45,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:35:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:35:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:35:45,769 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 4 states. [2018-11-14 16:35:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:46,266 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 16:35:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:35:46,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-14 16:35:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:35:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2018-11-14 16:35:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:35:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2018-11-14 16:35:46,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2018-11-14 16:35:46,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:46,543 INFO L225 Difference]: With dead ends: 114 [2018-11-14 16:35:46,543 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 16:35:46,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:35:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 16:35:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-11-14 16:35:46,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:46,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 98 states. [2018-11-14 16:35:46,600 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 98 states. [2018-11-14 16:35:46,600 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 98 states. [2018-11-14 16:35:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:46,606 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 16:35:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-14 16:35:46,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:46,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:46,607 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 112 states. [2018-11-14 16:35:46,607 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 112 states. [2018-11-14 16:35:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:46,612 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 16:35:46,612 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2018-11-14 16:35:46,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:46,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:46,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:46,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:35:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-14 16:35:46,617 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 55 [2018-11-14 16:35:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:46,617 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-14 16:35:46,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:35:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-14 16:35:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 16:35:46,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:46,619 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:46,619 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:46,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -383601812, now seen corresponding path program 1 times [2018-11-14 16:35:46,620 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:46,620 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:46,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:35:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:46,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:46,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {3861#true} call ULTIMATE.init(); {3861#true} is VALID [2018-11-14 16:35:46,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {3861#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3861#true} is VALID [2018-11-14 16:35:46,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3861#true} {3861#true} #221#return; {3861#true} is VALID [2018-11-14 16:35:46,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {3861#true} call #t~ret25 := main(); {3861#true} is VALID [2018-11-14 16:35:46,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {3861#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {3861#true} is VALID [2018-11-14 16:35:46,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {3861#true} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3861#true} is VALID [2018-11-14 16:35:46,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {3861#true} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3861#true} is VALID [2018-11-14 16:35:46,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {3861#true} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3861#true} is VALID [2018-11-14 16:35:46,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {3861#true} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3861#true} is VALID [2018-11-14 16:35:46,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {3861#true} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3861#true} is VALID [2018-11-14 16:35:46,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {3861#true} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3861#true} is VALID [2018-11-14 16:35:46,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {3861#true} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {3861#true} is VALID [2018-11-14 16:35:46,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {3861#true} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {3861#true} is VALID [2018-11-14 16:35:46,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {3861#true} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {3861#true} is VALID [2018-11-14 16:35:46,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {3861#true} assume !~bvsle32(~i~0, ~max~0); {3861#true} is VALID [2018-11-14 16:35:46,817 INFO L256 TraceCheckUtils]: 23: Hoare triple {3861#true} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {3861#true} is VALID [2018-11-14 16:35:46,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {3861#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3861#true} is VALID [2018-11-14 16:35:46,817 INFO L256 TraceCheckUtils]: 25: Hoare triple {3861#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3861#true} is VALID [2018-11-14 16:35:46,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {3861#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3861#true} is VALID [2018-11-14 16:35:46,817 INFO L273 TraceCheckUtils]: 27: Hoare triple {3861#true} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {3861#true} is VALID [2018-11-14 16:35:46,818 INFO L256 TraceCheckUtils]: 28: Hoare triple {3861#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3861#true} is VALID [2018-11-14 16:35:46,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {3861#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3861#true} is VALID [2018-11-14 16:35:46,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {3861#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3861#true} is VALID [2018-11-14 16:35:46,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {3861#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3861#true} is VALID [2018-11-14 16:35:46,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {3861#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3861#true} is VALID [2018-11-14 16:35:46,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {3861#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3861#true} is VALID [2018-11-14 16:35:46,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {3861#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3861#true} is VALID [2018-11-14 16:35:46,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {3861#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3861#true} is VALID [2018-11-14 16:35:46,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {3861#true} assume !~bvsgt32(~len, 0bv32); {3861#true} is VALID [2018-11-14 16:35:46,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {3861#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3861#true} is VALID [2018-11-14 16:35:46,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,820 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3861#true} {3861#true} #209#return; {3861#true} is VALID [2018-11-14 16:35:46,821 INFO L273 TraceCheckUtils]: 43: Hoare triple {3861#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3861#true} is VALID [2018-11-14 16:35:46,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,821 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3861#true} {3861#true} #219#return; {3861#true} is VALID [2018-11-14 16:35:46,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {3861#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3861#true} is VALID [2018-11-14 16:35:46,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {3861#true} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {3861#true} is VALID [2018-11-14 16:35:46,822 INFO L273 TraceCheckUtils]: 48: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,822 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3861#true} {3861#true} #213#return; {3861#true} is VALID [2018-11-14 16:35:46,822 INFO L273 TraceCheckUtils]: 50: Hoare triple {3861#true} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {3861#true} is VALID [2018-11-14 16:35:46,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {3861#true} assume true; {3861#true} is VALID [2018-11-14 16:35:46,833 INFO L273 TraceCheckUtils]: 52: Hoare triple {3861#true} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {4022#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:35:46,834 INFO L273 TraceCheckUtils]: 53: Hoare triple {4022#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} assume !~bvsgt32(~i~0, ~max~0); {4022#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:35:46,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {4022#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} assume true; {4022#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:35:46,836 INFO L273 TraceCheckUtils]: 55: Hoare triple {4022#(or (not (= (_ bv0 32) main_~ptr~0.base)) (not (= main_~ptr~0.offset (_ bv0 32))))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {3862#false} is VALID [2018-11-14 16:35:46,836 INFO L273 TraceCheckUtils]: 56: Hoare triple {3862#false} #t~post19 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post19);havoc #t~post19; {3862#false} is VALID [2018-11-14 16:35:46,837 INFO L273 TraceCheckUtils]: 57: Hoare triple {3862#false} assume true; {3862#false} is VALID [2018-11-14 16:35:46,837 INFO L273 TraceCheckUtils]: 58: Hoare triple {3862#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {3862#false} is VALID [2018-11-14 16:35:46,837 INFO L273 TraceCheckUtils]: 59: Hoare triple {3862#false} assume ~bvsgt32(~i~0, ~max~0); {3862#false} is VALID [2018-11-14 16:35:46,837 INFO L273 TraceCheckUtils]: 60: Hoare triple {3862#false} assume !false; {3862#false} is VALID [2018-11-14 16:35:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-14 16:35:46,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:46,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:46,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:35:46,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-11-14 16:35:46,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:46,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:35:46,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:46,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:35:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:35:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:35:46,943 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 3 states. [2018-11-14 16:35:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:47,230 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2018-11-14 16:35:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:35:47,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-11-14 16:35:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:35:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-14 16:35:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:35:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2018-11-14 16:35:47,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2018-11-14 16:35:47,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:47,394 INFO L225 Difference]: With dead ends: 128 [2018-11-14 16:35:47,395 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 16:35:47,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:35:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 16:35:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-11-14 16:35:47,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:47,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 100 states. [2018-11-14 16:35:47,490 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 100 states. [2018-11-14 16:35:47,491 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 100 states. [2018-11-14 16:35:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:47,495 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2018-11-14 16:35:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2018-11-14 16:35:47,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:47,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:47,496 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 105 states. [2018-11-14 16:35:47,496 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 105 states. [2018-11-14 16:35:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:47,500 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2018-11-14 16:35:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2018-11-14 16:35:47,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:47,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:47,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:47,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-14 16:35:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2018-11-14 16:35:47,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 61 [2018-11-14 16:35:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:47,505 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2018-11-14 16:35:47,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:35:47,505 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2018-11-14 16:35:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 16:35:47,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:47,507 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:47,507 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:47,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash -490740285, now seen corresponding path program 1 times [2018-11-14 16:35:47,508 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:47,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:47,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:48,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {4559#true} call ULTIMATE.init(); {4559#true} is VALID [2018-11-14 16:35:48,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {4559#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4559#true} is VALID [2018-11-14 16:35:48,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {4559#true} assume true; {4559#true} is VALID [2018-11-14 16:35:48,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4559#true} {4559#true} #221#return; {4559#true} is VALID [2018-11-14 16:35:48,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {4559#true} call #t~ret25 := main(); {4559#true} is VALID [2018-11-14 16:35:48,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {4559#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,487 INFO L273 TraceCheckUtils]: 16: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsle32(~i~0, ~max~0); {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:48,491 INFO L256 TraceCheckUtils]: 23: Hoare triple {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {4559#true} is VALID [2018-11-14 16:35:48,492 INFO L273 TraceCheckUtils]: 24: Hoare triple {4559#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {4637#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-14 16:35:48,492 INFO L256 TraceCheckUtils]: 25: Hoare triple {4637#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {4559#true} is VALID [2018-11-14 16:35:48,493 INFO L273 TraceCheckUtils]: 26: Hoare triple {4559#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {4644#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:35:48,494 INFO L273 TraceCheckUtils]: 27: Hoare triple {4644#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {4644#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:35:48,494 INFO L256 TraceCheckUtils]: 28: Hoare triple {4644#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {4559#true} is VALID [2018-11-14 16:35:48,495 INFO L273 TraceCheckUtils]: 29: Hoare triple {4559#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4654#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:48,495 INFO L273 TraceCheckUtils]: 30: Hoare triple {4654#(= |sll_create_#in~len| sll_create_~len)} assume true; {4654#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:48,496 INFO L273 TraceCheckUtils]: 31: Hoare triple {4654#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4654#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:48,497 INFO L273 TraceCheckUtils]: 32: Hoare triple {4654#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4654#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:48,498 INFO L273 TraceCheckUtils]: 33: Hoare triple {4654#(= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:48,498 INFO L273 TraceCheckUtils]: 34: Hoare triple {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:48,499 INFO L273 TraceCheckUtils]: 35: Hoare triple {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:48,499 INFO L273 TraceCheckUtils]: 36: Hoare triple {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:48,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {4667#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {4680#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:35:48,523 INFO L273 TraceCheckUtils]: 38: Hoare triple {4680#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume true; {4680#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:35:48,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {4680#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,527 INFO L273 TraceCheckUtils]: 41: Hoare triple {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,529 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {4644#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #209#return; {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,530 INFO L273 TraceCheckUtils]: 44: Hoare triple {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,533 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} {4637#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #219#return; {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:48,535 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} {4579#(= (bvadd main_~min~0 (_ bv4294967293 32)) (_ bv0 32))} #213#return; {4560#false} is VALID [2018-11-14 16:35:48,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {4560#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {4560#false} is VALID [2018-11-14 16:35:48,536 INFO L273 TraceCheckUtils]: 51: Hoare triple {4560#false} assume true; {4560#false} is VALID [2018-11-14 16:35:48,536 INFO L273 TraceCheckUtils]: 52: Hoare triple {4560#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {4560#false} is VALID [2018-11-14 16:35:48,536 INFO L273 TraceCheckUtils]: 53: Hoare triple {4560#false} assume !~bvsgt32(~i~0, ~max~0); {4560#false} is VALID [2018-11-14 16:35:48,536 INFO L273 TraceCheckUtils]: 54: Hoare triple {4560#false} assume true; {4560#false} is VALID [2018-11-14 16:35:48,536 INFO L273 TraceCheckUtils]: 55: Hoare triple {4560#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {4560#false} is VALID [2018-11-14 16:35:48,537 INFO L256 TraceCheckUtils]: 56: Hoare triple {4560#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {4560#false} is VALID [2018-11-14 16:35:48,537 INFO L273 TraceCheckUtils]: 57: Hoare triple {4560#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4560#false} is VALID [2018-11-14 16:35:48,537 INFO L273 TraceCheckUtils]: 58: Hoare triple {4560#false} assume true; {4560#false} is VALID [2018-11-14 16:35:48,537 INFO L273 TraceCheckUtils]: 59: Hoare triple {4560#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4560#false} is VALID [2018-11-14 16:35:48,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {4560#false} #res := ~len~0; {4560#false} is VALID [2018-11-14 16:35:48,538 INFO L273 TraceCheckUtils]: 61: Hoare triple {4560#false} assume true; {4560#false} is VALID [2018-11-14 16:35:48,538 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4560#false} {4560#false} #215#return; {4560#false} is VALID [2018-11-14 16:35:48,538 INFO L273 TraceCheckUtils]: 63: Hoare triple {4560#false} ~count~0 := #t~ret21;havoc #t~mem20.base, #t~mem20.offset;havoc #t~ret21; {4560#false} is VALID [2018-11-14 16:35:48,539 INFO L273 TraceCheckUtils]: 64: Hoare triple {4560#false} assume !(~i~0 == ~count~0); {4560#false} is VALID [2018-11-14 16:35:48,539 INFO L273 TraceCheckUtils]: 65: Hoare triple {4560#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {4560#false} is VALID [2018-11-14 16:35:48,539 INFO L273 TraceCheckUtils]: 66: Hoare triple {4560#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {4560#false} is VALID [2018-11-14 16:35:48,539 INFO L273 TraceCheckUtils]: 67: Hoare triple {4560#false} assume !false; {4560#false} is VALID [2018-11-14 16:35:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 16:35:48,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:49,483 INFO L273 TraceCheckUtils]: 67: Hoare triple {4560#false} assume !false; {4560#false} is VALID [2018-11-14 16:35:49,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {4560#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {4560#false} is VALID [2018-11-14 16:35:49,484 INFO L273 TraceCheckUtils]: 65: Hoare triple {4560#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {4560#false} is VALID [2018-11-14 16:35:49,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {4560#false} assume !(~i~0 == ~count~0); {4560#false} is VALID [2018-11-14 16:35:49,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {4560#false} ~count~0 := #t~ret21;havoc #t~mem20.base, #t~mem20.offset;havoc #t~ret21; {4560#false} is VALID [2018-11-14 16:35:49,484 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4559#true} {4560#false} #215#return; {4560#false} is VALID [2018-11-14 16:35:49,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {4559#true} assume true; {4559#true} is VALID [2018-11-14 16:35:49,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {4559#true} #res := ~len~0; {4559#true} is VALID [2018-11-14 16:35:49,485 INFO L273 TraceCheckUtils]: 59: Hoare triple {4559#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4559#true} is VALID [2018-11-14 16:35:49,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {4559#true} assume true; {4559#true} is VALID [2018-11-14 16:35:49,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {4559#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4559#true} is VALID [2018-11-14 16:35:49,486 INFO L256 TraceCheckUtils]: 56: Hoare triple {4560#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {4559#true} is VALID [2018-11-14 16:35:49,486 INFO L273 TraceCheckUtils]: 55: Hoare triple {4560#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {4560#false} is VALID [2018-11-14 16:35:49,486 INFO L273 TraceCheckUtils]: 54: Hoare triple {4560#false} assume true; {4560#false} is VALID [2018-11-14 16:35:49,486 INFO L273 TraceCheckUtils]: 53: Hoare triple {4560#false} assume !~bvsgt32(~i~0, ~max~0); {4560#false} is VALID [2018-11-14 16:35:49,486 INFO L273 TraceCheckUtils]: 52: Hoare triple {4560#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {4560#false} is VALID [2018-11-14 16:35:49,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {4560#false} assume true; {4560#false} is VALID [2018-11-14 16:35:49,487 INFO L273 TraceCheckUtils]: 50: Hoare triple {4560#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {4560#false} is VALID [2018-11-14 16:35:49,490 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} #213#return; {4560#false} is VALID [2018-11-14 16:35:49,491 INFO L273 TraceCheckUtils]: 48: Hoare triple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,492 INFO L273 TraceCheckUtils]: 46: Hoare triple {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,494 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} {4844#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} #219#return; {4707#(not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,495 INFO L273 TraceCheckUtils]: 43: Hoare triple {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,498 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {4857#(or (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} #209#return; {4697#(not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,499 INFO L273 TraceCheckUtils]: 39: Hoare triple {4870#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {4687#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {4870#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {4870#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,503 INFO L273 TraceCheckUtils]: 37: Hoare triple {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {4870#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,504 INFO L273 TraceCheckUtils]: 35: Hoare triple {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,504 INFO L273 TraceCheckUtils]: 34: Hoare triple {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {4877#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,511 INFO L273 TraceCheckUtils]: 32: Hoare triple {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,511 INFO L273 TraceCheckUtils]: 31: Hoare triple {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {4559#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4890#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,512 INFO L256 TraceCheckUtils]: 28: Hoare triple {4857#(or (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {4559#true} is VALID [2018-11-14 16:35:49,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {4857#(or (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {4857#(or (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {4559#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {4857#(or (bvsgt (bvadd node_create_with_sublist_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |node_create_with_sublist_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,515 INFO L256 TraceCheckUtils]: 25: Hoare triple {4844#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {4559#true} is VALID [2018-11-14 16:35:49,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {4559#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {4844#(or (bvsgt (bvadd sll_append_~sublist_length (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_append_#in~sublist_length| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:49,533 INFO L256 TraceCheckUtils]: 23: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {4559#true} is VALID [2018-11-14 16:35:49,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsle32(~i~0, ~max~0); {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,540 INFO L273 TraceCheckUtils]: 17: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {4559#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {4828#(bvsgt (bvadd main_~min~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {4559#true} call #t~ret25 := main(); {4559#true} is VALID [2018-11-14 16:35:49,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4559#true} {4559#true} #221#return; {4559#true} is VALID [2018-11-14 16:35:49,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {4559#true} assume true; {4559#true} is VALID [2018-11-14 16:35:49,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {4559#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4559#true} is VALID [2018-11-14 16:35:49,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {4559#true} call ULTIMATE.init(); {4559#true} is VALID [2018-11-14 16:35:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 16:35:49,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:49,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-14 16:35:49,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2018-11-14 16:35:49,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:49,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:35:49,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:49,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:35:49,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:35:49,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:35:49,716 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand 17 states. [2018-11-14 16:35:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:53,924 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2018-11-14 16:35:53,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:35:53,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2018-11-14 16:35:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:35:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2018-11-14 16:35:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:35:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2018-11-14 16:35:53,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 132 transitions. [2018-11-14 16:35:54,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:54,652 INFO L225 Difference]: With dead ends: 160 [2018-11-14 16:35:54,652 INFO L226 Difference]: Without dead ends: 134 [2018-11-14 16:35:54,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:35:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-14 16:35:54,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2018-11-14 16:35:54,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:54,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 104 states. [2018-11-14 16:35:54,719 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 104 states. [2018-11-14 16:35:54,719 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 104 states. [2018-11-14 16:35:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:54,726 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-14 16:35:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-14 16:35:54,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:54,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:54,727 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 134 states. [2018-11-14 16:35:54,727 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 134 states. [2018-11-14 16:35:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:54,732 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-11-14 16:35:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2018-11-14 16:35:54,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:54,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:54,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:54,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:35:54,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2018-11-14 16:35:54,737 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 68 [2018-11-14 16:35:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:54,738 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-11-14 16:35:54,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:35:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2018-11-14 16:35:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 16:35:54,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:54,739 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:54,739 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:54,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1714102667, now seen corresponding path program 2 times [2018-11-14 16:35:54,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:54,756 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:35:54,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:35:54,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:54,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:55,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:35:55,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 16:35:55,053 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:55,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 16:35:55,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 16:35:55,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:55,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:55,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 33 [2018-11-14 16:35:55,422 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-11-14 16:35:55,486 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:55,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:35:55,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-14 16:35:55,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-11-14 16:35:55,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:55,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-11-14 16:35:55,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 37 [2018-11-14 16:35:55,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 37 [2018-11-14 16:35:55,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-14 16:35:56,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-14 16:35:56,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:56,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:35:56,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:35:56,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:56,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:56,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:56,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:35:56,324 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:43, output treesize:110 [2018-11-14 16:35:57,846 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:58,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:58,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:58,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-14 16:35:58,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:137, output treesize:42 [2018-11-14 16:35:58,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:35:58,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:35:58,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:35:58,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:42 [2018-11-14 16:35:58,427 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:58,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-11-14 16:35:58,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-14 16:35:58,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-11-14 16:35:58,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:58,603 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:4 [2018-11-14 16:35:58,608 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:58,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {5605#true} call ULTIMATE.init(); {5605#true} is VALID [2018-11-14 16:35:58,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {5605#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5605#true} is VALID [2018-11-14 16:35:58,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {5605#true} assume true; {5605#true} is VALID [2018-11-14 16:35:58,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5605#true} {5605#true} #221#return; {5605#true} is VALID [2018-11-14 16:35:58,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {5605#true} call #t~ret25 := main(); {5605#true} is VALID [2018-11-14 16:35:58,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {5605#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,723 INFO L273 TraceCheckUtils]: 6: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !~bvsle32(~i~0, ~max~0); {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:35:58,735 INFO L256 TraceCheckUtils]: 23: Hoare triple {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {5680#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:35:58,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {5680#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {5684#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 16:35:58,737 INFO L256 TraceCheckUtils]: 25: Hoare triple {5684#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {5680#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:35:58,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {5680#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {5691#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 16:35:58,740 INFO L273 TraceCheckUtils]: 27: Hoare triple {5691#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {5691#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 16:35:58,740 INFO L256 TraceCheckUtils]: 28: Hoare triple {5691#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {5605#true} is VALID [2018-11-14 16:35:58,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {5605#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5605#true} is VALID [2018-11-14 16:35:58,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {5605#true} assume true; {5605#true} is VALID [2018-11-14 16:35:58,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {5605#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5605#true} is VALID [2018-11-14 16:35:58,741 INFO L273 TraceCheckUtils]: 32: Hoare triple {5605#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5605#true} is VALID [2018-11-14 16:35:58,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {5605#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {5605#true} is VALID [2018-11-14 16:35:58,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {5605#true} assume true; {5605#true} is VALID [2018-11-14 16:35:58,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {5605#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5605#true} is VALID [2018-11-14 16:35:58,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {5605#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5605#true} is VALID [2018-11-14 16:35:58,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {5605#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {5605#true} is VALID [2018-11-14 16:35:58,742 INFO L273 TraceCheckUtils]: 38: Hoare triple {5605#true} assume true; {5605#true} is VALID [2018-11-14 16:35:58,742 INFO L273 TraceCheckUtils]: 39: Hoare triple {5605#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5731#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:35:58,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {5731#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5731#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:35:58,743 INFO L273 TraceCheckUtils]: 41: Hoare triple {5731#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {5738#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:35:58,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {5738#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {5738#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:35:58,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {5738#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {5738#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:35:58,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {5738#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5748#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:35:58,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {5748#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {5748#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:35:58,746 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5748#(not (= (_ bv0 32) |sll_create_#res.base|))} {5691#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} #209#return; {5755#(and (not (= (_ bv0 32) |node_create_with_sublist_#t~ret5.base|)) (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 16:35:58,748 INFO L273 TraceCheckUtils]: 47: Hoare triple {5755#(and (not (= (_ bv0 32) |node_create_with_sublist_#t~ret5.base|)) (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {5759#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} is VALID [2018-11-14 16:35:58,749 INFO L273 TraceCheckUtils]: 48: Hoare triple {5759#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} assume true; {5759#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} is VALID [2018-11-14 16:35:58,752 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {5759#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} {5684#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #219#return; {5766#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32)) (_ bv0 32))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret8.offset|) (= (_ bv0 1) (select |old(#valid)| |sll_append_#t~ret8.base|)))} is VALID [2018-11-14 16:35:58,754 INFO L273 TraceCheckUtils]: 50: Hoare triple {5766#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32)) (_ bv0 32))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret8.offset|) (= (_ bv0 1) (select |old(#valid)| |sll_append_#t~ret8.base|)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {5770#(and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32)) (_ bv0 32))) (= sll_append_~new_last~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:35:58,760 INFO L273 TraceCheckUtils]: 51: Hoare triple {5770#(and (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32)) (_ bv0 32))) (= sll_append_~new_last~0.offset (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {5774#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} is VALID [2018-11-14 16:35:58,761 INFO L273 TraceCheckUtils]: 52: Hoare triple {5774#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} assume true; {5774#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} is VALID [2018-11-14 16:35:58,763 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {5774#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|)))} {5625#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #213#return; {5781#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:58,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {5781#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (_ bv0 32))) (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:35:58,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:35:58,768 INFO L273 TraceCheckUtils]: 56: Hoare triple {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:35:58,769 INFO L273 TraceCheckUtils]: 57: Hoare triple {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume !~bvsgt32(~i~0, ~max~0); {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:35:58,770 INFO L273 TraceCheckUtils]: 58: Hoare triple {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:35:58,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {5785#(and (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base))) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {5801#(not (= |main_#t~mem20.base| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,772 INFO L256 TraceCheckUtils]: 60: Hoare triple {5801#(not (= |main_#t~mem20.base| (_ bv0 32)))} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {5605#true} is VALID [2018-11-14 16:35:58,773 INFO L273 TraceCheckUtils]: 61: Hoare triple {5605#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5808#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:58,773 INFO L273 TraceCheckUtils]: 62: Hoare triple {5808#(= sll_length_~head.base |sll_length_#in~head.base|)} assume true; {5808#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:58,774 INFO L273 TraceCheckUtils]: 63: Hoare triple {5808#(= sll_length_~head.base |sll_length_#in~head.base|)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5815#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:58,775 INFO L273 TraceCheckUtils]: 64: Hoare triple {5815#(= (_ bv0 32) |sll_length_#in~head.base|)} #res := ~len~0; {5815#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:58,775 INFO L273 TraceCheckUtils]: 65: Hoare triple {5815#(= (_ bv0 32) |sll_length_#in~head.base|)} assume true; {5815#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:58,776 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {5815#(= (_ bv0 32) |sll_length_#in~head.base|)} {5801#(not (= |main_#t~mem20.base| (_ bv0 32)))} #215#return; {5606#false} is VALID [2018-11-14 16:35:58,777 INFO L273 TraceCheckUtils]: 67: Hoare triple {5606#false} ~count~0 := #t~ret21;havoc #t~mem20.base, #t~mem20.offset;havoc #t~ret21; {5606#false} is VALID [2018-11-14 16:35:58,777 INFO L273 TraceCheckUtils]: 68: Hoare triple {5606#false} assume !(~i~0 == ~count~0); {5606#false} is VALID [2018-11-14 16:35:58,777 INFO L273 TraceCheckUtils]: 69: Hoare triple {5606#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {5606#false} is VALID [2018-11-14 16:35:58,777 INFO L273 TraceCheckUtils]: 70: Hoare triple {5606#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {5606#false} is VALID [2018-11-14 16:35:58,777 INFO L273 TraceCheckUtils]: 71: Hoare triple {5606#false} assume !false; {5606#false} is VALID [2018-11-14 16:35:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-14 16:35:58,797 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:58,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:58,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-14 16:35:58,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-11-14 16:35:58,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:58,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 16:35:58,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:58,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 16:35:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 16:35:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:35:58,898 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 19 states. [2018-11-14 16:36:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:09,562 INFO L93 Difference]: Finished difference Result 228 states and 310 transitions. [2018-11-14 16:36:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:36:09,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2018-11-14 16:36:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:36:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 186 transitions. [2018-11-14 16:36:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:36:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 186 transitions. [2018-11-14 16:36:09,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 186 transitions. [2018-11-14 16:36:09,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:09,923 INFO L225 Difference]: With dead ends: 228 [2018-11-14 16:36:09,923 INFO L226 Difference]: Without dead ends: 203 [2018-11-14 16:36:09,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:36:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-14 16:36:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 143. [2018-11-14 16:36:10,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:10,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand 143 states. [2018-11-14 16:36:10,525 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 143 states. [2018-11-14 16:36:10,525 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 143 states. [2018-11-14 16:36:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:10,536 INFO L93 Difference]: Finished difference Result 203 states and 279 transitions. [2018-11-14 16:36:10,537 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2018-11-14 16:36:10,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:10,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:10,539 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 203 states. [2018-11-14 16:36:10,539 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 203 states. [2018-11-14 16:36:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:10,550 INFO L93 Difference]: Finished difference Result 203 states and 279 transitions. [2018-11-14 16:36:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2018-11-14 16:36:10,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:10,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:10,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:10,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 16:36:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 180 transitions. [2018-11-14 16:36:10,558 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 180 transitions. Word has length 72 [2018-11-14 16:36:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:10,559 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 180 transitions. [2018-11-14 16:36:10,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 16:36:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 180 transitions. [2018-11-14 16:36:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 16:36:10,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:10,560 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:36:10,561 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:10,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:10,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2075331175, now seen corresponding path program 1 times [2018-11-14 16:36:10,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:10,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:36:10,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:36:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:10,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:11,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {6752#true} call ULTIMATE.init(); {6752#true} is VALID [2018-11-14 16:36:11,097 INFO L273 TraceCheckUtils]: 1: Hoare triple {6752#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6752#true} is VALID [2018-11-14 16:36:11,097 INFO L273 TraceCheckUtils]: 2: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,097 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6752#true} {6752#true} #221#return; {6752#true} is VALID [2018-11-14 16:36:11,097 INFO L256 TraceCheckUtils]: 4: Hoare triple {6752#true} call #t~ret25 := main(); {6752#true} is VALID [2018-11-14 16:36:11,098 INFO L273 TraceCheckUtils]: 5: Hoare triple {6752#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {6772#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6788#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:36:11,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {6788#(= (_ bv4 32) main_~i~0)} assume true; {6788#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:36:11,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {6788#(= (_ bv4 32) main_~i~0)} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {6788#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:36:11,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {6788#(= (_ bv4 32) main_~i~0)} assume true; {6788#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:36:11,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {6788#(= (_ bv4 32) main_~i~0)} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6788#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:36:11,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {6788#(= (_ bv4 32) main_~i~0)} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,105 INFO L256 TraceCheckUtils]: 20: Hoare triple {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {6752#true} is VALID [2018-11-14 16:36:11,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {6752#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {6823#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-14 16:36:11,106 INFO L256 TraceCheckUtils]: 22: Hoare triple {6823#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6752#true} is VALID [2018-11-14 16:36:11,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {6752#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {6830#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:36:11,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {6830#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {6830#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-14 16:36:11,112 INFO L256 TraceCheckUtils]: 25: Hoare triple {6830#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6752#true} is VALID [2018-11-14 16:36:11,112 INFO L273 TraceCheckUtils]: 26: Hoare triple {6752#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6840#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:11,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {6840#(= |sll_create_#in~len| sll_create_~len)} assume true; {6840#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:11,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {6840#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,114 INFO L273 TraceCheckUtils]: 30: Hoare triple {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,115 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {6830#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #209#return; {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} assume true; {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,117 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} {6823#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #219#return; {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,118 INFO L273 TraceCheckUtils]: 35: Hoare triple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume true; {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,120 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} {6804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #211#return; {6753#false} is VALID [2018-11-14 16:36:11,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {6753#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {6753#false} is VALID [2018-11-14 16:36:11,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {6753#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#false} assume !~bvsle32(~i~0, ~max~0); {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L256 TraceCheckUtils]: 45: Hoare triple {6753#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L273 TraceCheckUtils]: 46: Hoare triple {6753#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L256 TraceCheckUtils]: 47: Hoare triple {6753#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L273 TraceCheckUtils]: 48: Hoare triple {6753#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {6753#false} is VALID [2018-11-14 16:36:11,121 INFO L273 TraceCheckUtils]: 49: Hoare triple {6753#false} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L256 TraceCheckUtils]: 50: Hoare triple {6753#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 51: Hoare triple {6753#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {6753#false} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {6753#false} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {6753#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 56: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,122 INFO L273 TraceCheckUtils]: 57: Hoare triple {6753#false} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6753#false} is VALID [2018-11-14 16:36:11,123 INFO L273 TraceCheckUtils]: 58: Hoare triple {6753#false} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6753#false} is VALID [2018-11-14 16:36:11,123 INFO L273 TraceCheckUtils]: 59: Hoare triple {6753#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6753#false} is VALID [2018-11-14 16:36:11,123 INFO L273 TraceCheckUtils]: 60: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,123 INFO L273 TraceCheckUtils]: 61: Hoare triple {6753#false} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6753#false} is VALID [2018-11-14 16:36:11,123 INFO L273 TraceCheckUtils]: 62: Hoare triple {6753#false} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6753#false} is VALID [2018-11-14 16:36:11,123 INFO L273 TraceCheckUtils]: 63: Hoare triple {6753#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6753#false} is VALID [2018-11-14 16:36:11,124 INFO L273 TraceCheckUtils]: 64: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,124 INFO L273 TraceCheckUtils]: 65: Hoare triple {6753#false} assume !~bvsgt32(~len, 0bv32); {6753#false} is VALID [2018-11-14 16:36:11,124 INFO L273 TraceCheckUtils]: 66: Hoare triple {6753#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6753#false} is VALID [2018-11-14 16:36:11,124 INFO L273 TraceCheckUtils]: 67: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,124 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {6753#false} {6753#false} #209#return; {6753#false} is VALID [2018-11-14 16:36:11,125 INFO L273 TraceCheckUtils]: 69: Hoare triple {6753#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6753#false} is VALID [2018-11-14 16:36:11,125 INFO L273 TraceCheckUtils]: 70: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,125 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {6753#false} {6753#false} #219#return; {6753#false} is VALID [2018-11-14 16:36:11,125 INFO L273 TraceCheckUtils]: 72: Hoare triple {6753#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6753#false} is VALID [2018-11-14 16:36:11,125 INFO L273 TraceCheckUtils]: 73: Hoare triple {6753#false} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {6753#false} is VALID [2018-11-14 16:36:11,126 INFO L273 TraceCheckUtils]: 74: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,126 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6753#false} {6753#false} #213#return; {6753#false} is VALID [2018-11-14 16:36:11,126 INFO L273 TraceCheckUtils]: 76: Hoare triple {6753#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {6753#false} is VALID [2018-11-14 16:36:11,126 INFO L273 TraceCheckUtils]: 77: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,126 INFO L273 TraceCheckUtils]: 78: Hoare triple {6753#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {6753#false} is VALID [2018-11-14 16:36:11,127 INFO L273 TraceCheckUtils]: 79: Hoare triple {6753#false} assume !~bvsgt32(~i~0, ~max~0); {6753#false} is VALID [2018-11-14 16:36:11,127 INFO L273 TraceCheckUtils]: 80: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,127 INFO L273 TraceCheckUtils]: 81: Hoare triple {6753#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {6753#false} is VALID [2018-11-14 16:36:11,127 INFO L256 TraceCheckUtils]: 82: Hoare triple {6753#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {6753#false} is VALID [2018-11-14 16:36:11,127 INFO L273 TraceCheckUtils]: 83: Hoare triple {6753#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {6753#false} is VALID [2018-11-14 16:36:11,128 INFO L273 TraceCheckUtils]: 84: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,128 INFO L273 TraceCheckUtils]: 85: Hoare triple {6753#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {6753#false} is VALID [2018-11-14 16:36:11,128 INFO L273 TraceCheckUtils]: 86: Hoare triple {6753#false} #res := ~len~0; {6753#false} is VALID [2018-11-14 16:36:11,128 INFO L273 TraceCheckUtils]: 87: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,128 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {6753#false} {6753#false} #215#return; {6753#false} is VALID [2018-11-14 16:36:11,128 INFO L273 TraceCheckUtils]: 89: Hoare triple {6753#false} ~count~0 := #t~ret21;havoc #t~mem20.base, #t~mem20.offset;havoc #t~ret21; {6753#false} is VALID [2018-11-14 16:36:11,129 INFO L273 TraceCheckUtils]: 90: Hoare triple {6753#false} assume !(~i~0 == ~count~0); {6753#false} is VALID [2018-11-14 16:36:11,129 INFO L273 TraceCheckUtils]: 91: Hoare triple {6753#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {6753#false} is VALID [2018-11-14 16:36:11,129 INFO L273 TraceCheckUtils]: 92: Hoare triple {6753#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {6753#false} is VALID [2018-11-14 16:36:11,129 INFO L273 TraceCheckUtils]: 93: Hoare triple {6753#false} assume !false; {6753#false} is VALID [2018-11-14 16:36:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:36:11,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:11,776 INFO L273 TraceCheckUtils]: 93: Hoare triple {6753#false} assume !false; {6753#false} is VALID [2018-11-14 16:36:11,777 INFO L273 TraceCheckUtils]: 92: Hoare triple {6753#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {6753#false} is VALID [2018-11-14 16:36:11,777 INFO L273 TraceCheckUtils]: 91: Hoare triple {6753#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {6753#false} is VALID [2018-11-14 16:36:11,777 INFO L273 TraceCheckUtils]: 90: Hoare triple {6753#false} assume !(~i~0 == ~count~0); {6753#false} is VALID [2018-11-14 16:36:11,777 INFO L273 TraceCheckUtils]: 89: Hoare triple {6753#false} ~count~0 := #t~ret21;havoc #t~mem20.base, #t~mem20.offset;havoc #t~ret21; {6753#false} is VALID [2018-11-14 16:36:11,778 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {6752#true} {6753#false} #215#return; {6753#false} is VALID [2018-11-14 16:36:11,778 INFO L273 TraceCheckUtils]: 87: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,778 INFO L273 TraceCheckUtils]: 86: Hoare triple {6752#true} #res := ~len~0; {6752#true} is VALID [2018-11-14 16:36:11,778 INFO L273 TraceCheckUtils]: 85: Hoare triple {6752#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {6752#true} is VALID [2018-11-14 16:36:11,778 INFO L273 TraceCheckUtils]: 84: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,778 INFO L273 TraceCheckUtils]: 83: Hoare triple {6752#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {6752#true} is VALID [2018-11-14 16:36:11,779 INFO L256 TraceCheckUtils]: 82: Hoare triple {6753#false} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {6752#true} is VALID [2018-11-14 16:36:11,779 INFO L273 TraceCheckUtils]: 81: Hoare triple {6753#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {6753#false} is VALID [2018-11-14 16:36:11,779 INFO L273 TraceCheckUtils]: 80: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,779 INFO L273 TraceCheckUtils]: 79: Hoare triple {6753#false} assume !~bvsgt32(~i~0, ~max~0); {6753#false} is VALID [2018-11-14 16:36:11,779 INFO L273 TraceCheckUtils]: 78: Hoare triple {6753#false} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {6753#false} is VALID [2018-11-14 16:36:11,779 INFO L273 TraceCheckUtils]: 77: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,779 INFO L273 TraceCheckUtils]: 76: Hoare triple {6753#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {6753#false} is VALID [2018-11-14 16:36:11,779 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {6752#true} {6753#false} #213#return; {6753#false} is VALID [2018-11-14 16:36:11,780 INFO L273 TraceCheckUtils]: 74: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L273 TraceCheckUtils]: 73: Hoare triple {6752#true} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L273 TraceCheckUtils]: 72: Hoare triple {6752#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {6752#true} {6752#true} #219#return; {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L273 TraceCheckUtils]: 70: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L273 TraceCheckUtils]: 69: Hoare triple {6752#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {6752#true} {6752#true} #209#return; {6752#true} is VALID [2018-11-14 16:36:11,780 INFO L273 TraceCheckUtils]: 67: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 66: Hoare triple {6752#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 65: Hoare triple {6752#true} assume !~bvsgt32(~len, 0bv32); {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 64: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 63: Hoare triple {6752#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 62: Hoare triple {6752#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 61: Hoare triple {6752#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 60: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {6752#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {6752#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {6752#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 56: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {6752#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {6752#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {6752#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,782 INFO L273 TraceCheckUtils]: 51: Hoare triple {6752#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L256 TraceCheckUtils]: 50: Hoare triple {6752#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L273 TraceCheckUtils]: 49: Hoare triple {6752#true} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L273 TraceCheckUtils]: 48: Hoare triple {6752#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L256 TraceCheckUtils]: 47: Hoare triple {6752#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {6752#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L256 TraceCheckUtils]: 45: Hoare triple {6753#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {6752#true} is VALID [2018-11-14 16:36:11,783 INFO L273 TraceCheckUtils]: 44: Hoare triple {6753#false} assume !~bvsle32(~i~0, ~max~0); {6753#false} is VALID [2018-11-14 16:36:11,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#false} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {6753#false} is VALID [2018-11-14 16:36:11,784 INFO L273 TraceCheckUtils]: 41: Hoare triple {6753#false} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {6753#false} is VALID [2018-11-14 16:36:11,784 INFO L273 TraceCheckUtils]: 40: Hoare triple {6753#false} assume true; {6753#false} is VALID [2018-11-14 16:36:11,784 INFO L273 TraceCheckUtils]: 39: Hoare triple {6753#false} #t~post16 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post16);havoc #t~post16; {6753#false} is VALID [2018-11-14 16:36:11,785 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} {7210#(bvsgt main_~i~0 (_ bv0 32))} #211#return; {6753#false} is VALID [2018-11-14 16:36:11,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume true; {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,787 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} {7226#(or (bvsgt sll_append_~sublist_length (_ bv0 32)) (not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32))))} #219#return; {6867#(not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,787 INFO L273 TraceCheckUtils]: 33: Hoare triple {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} assume true; {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,787 INFO L273 TraceCheckUtils]: 32: Hoare triple {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,788 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {7239#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} #209#return; {6857#(not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {7252#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {6847#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:36:11,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {7252#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {7252#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:36:11,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {6752#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {7252#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:36:11,791 INFO L256 TraceCheckUtils]: 25: Hoare triple {7239#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6752#true} is VALID [2018-11-14 16:36:11,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {7239#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {7239#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} is VALID [2018-11-14 16:36:11,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {6752#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {7239#(or (not (bvsgt |node_create_with_sublist_#in~sublist_length| (_ bv0 32))) (bvsgt node_create_with_sublist_~sublist_length (_ bv0 32)))} is VALID [2018-11-14 16:36:11,793 INFO L256 TraceCheckUtils]: 22: Hoare triple {7226#(or (bvsgt sll_append_~sublist_length (_ bv0 32)) (not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32))))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6752#true} is VALID [2018-11-14 16:36:11,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {6752#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {7226#(or (bvsgt sll_append_~sublist_length (_ bv0 32)) (not (bvsgt |sll_append_#in~sublist_length| (_ bv0 32))))} is VALID [2018-11-14 16:36:11,794 INFO L256 TraceCheckUtils]: 20: Hoare triple {7210#(bvsgt main_~i~0 (_ bv0 32))} call sll_append(~#head~1.base, ~#head~1.offset, ~i~0); {6752#true} is VALID [2018-11-14 16:36:11,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {7210#(bvsgt main_~i~0 (_ bv0 32))} assume !!(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {7210#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:36:11,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {7210#(bvsgt main_~i~0 (_ bv0 32))} assume true; {7210#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:36:11,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {7210#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {7210#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:36:11,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {7210#(bvsgt main_~i~0 (_ bv0 32))} assume true; {7210#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:36:11,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {7210#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:36:11,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,868 INFO L273 TraceCheckUtils]: 12: Hoare triple {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume true; {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {7283#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume true; {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} assume true; {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {6752#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {7299#(bvsgt (bvadd main_~i~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:11,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {6752#true} call #t~ret25 := main(); {6752#true} is VALID [2018-11-14 16:36:11,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6752#true} {6752#true} #221#return; {6752#true} is VALID [2018-11-14 16:36:11,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {6752#true} assume true; {6752#true} is VALID [2018-11-14 16:36:11,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {6752#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6752#true} is VALID [2018-11-14 16:36:11,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {6752#true} call ULTIMATE.init(); {6752#true} is VALID [2018-11-14 16:36:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-14 16:36:11,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-11-14 16:36:11,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2018-11-14 16:36:11,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:11,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:36:12,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:12,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:36:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:36:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:36:12,094 INFO L87 Difference]: Start difference. First operand 143 states and 180 transitions. Second operand 17 states. [2018-11-14 16:36:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:17,230 INFO L93 Difference]: Finished difference Result 444 states and 598 transitions. [2018-11-14 16:36:17,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:36:17,230 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2018-11-14 16:36:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:36:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 298 transitions. [2018-11-14 16:36:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:36:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 298 transitions. [2018-11-14 16:36:17,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 298 transitions. [2018-11-14 16:36:17,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:17,714 INFO L225 Difference]: With dead ends: 444 [2018-11-14 16:36:17,715 INFO L226 Difference]: Without dead ends: 326 [2018-11-14 16:36:17,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:36:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-14 16:36:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 217. [2018-11-14 16:36:18,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:18,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 217 states. [2018-11-14 16:36:18,450 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 217 states. [2018-11-14 16:36:18,450 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 217 states. [2018-11-14 16:36:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:18,464 INFO L93 Difference]: Finished difference Result 326 states and 441 transitions. [2018-11-14 16:36:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 441 transitions. [2018-11-14 16:36:18,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:18,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:18,467 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 326 states. [2018-11-14 16:36:18,467 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 326 states. [2018-11-14 16:36:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:18,479 INFO L93 Difference]: Finished difference Result 326 states and 441 transitions. [2018-11-14 16:36:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 441 transitions. [2018-11-14 16:36:18,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:18,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:18,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:18,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-14 16:36:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2018-11-14 16:36:18,488 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 94 [2018-11-14 16:36:18,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:18,489 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2018-11-14 16:36:18,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:36:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2018-11-14 16:36:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-14 16:36:18,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:18,491 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:36:18,491 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:18,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1967010863, now seen corresponding path program 1 times [2018-11-14 16:36:18,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:36:18,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:36:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:18,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:18,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:36:18,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:18,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:18,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 16:36:18,955 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:21,073 WARN L854 $PredicateComparison]: unable to prove that (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |c_old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))) is different from true [2018-11-14 16:36:22,845 WARN L179 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:36:24,890 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 16:36:26,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:36:26,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:36:26,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:26,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:27,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:32 [2018-11-14 16:36:27,014 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:27,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:27,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:27,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 58 [2018-11-14 16:36:27,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-14 16:36:27,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:27,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-14 16:36:27,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 16:36:27,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 16:36:27,477 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:27,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 16:36:27,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,491 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:27,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:27,544 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:84 [2018-11-14 16:36:29,604 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:30,050 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:30,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:30,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:30,059 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:30,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 73 [2018-11-14 16:36:30,231 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 92 [2018-11-14 16:36:30,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:30,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:30,431 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:30,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-14 16:36:30,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-14 16:36:30,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:30,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:30,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:30,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:111, output treesize:105 [2018-11-14 16:36:30,870 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-14 16:36:30,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-14 16:36:30,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-14 16:36:30,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:31,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:31,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:31,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:31,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 92 [2018-11-14 16:36:31,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2018-11-14 16:36:31,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:31,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-11-14 16:36:31,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:31,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:31,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 71 [2018-11-14 16:36:31,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-11-14 16:36:32,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:36:32,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-14 16:36:32,380 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:102, output treesize:437 [2018-11-14 16:36:34,392 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:35,055 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 87 [2018-11-14 16:36:35,403 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 44 [2018-11-14 16:36:35,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:35,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:35,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:35,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-11-14 16:36:35,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 76 [2018-11-14 16:36:35,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:35,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:35,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:35,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 61 [2018-11-14 16:36:35,568 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:35,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:35,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:35,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:35,690 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:329, output treesize:104 [2018-11-14 16:36:35,707 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:36,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-11-14 16:36:36,605 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:36,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-14 16:36:36,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:36,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-11-14 16:36:36,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:36,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:36,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:36,706 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:135, output treesize:86 [2018-11-14 16:36:36,734 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:38,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {8866#true} call ULTIMATE.init(); {8866#true} is VALID [2018-11-14 16:36:38,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {8866#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {8866#true} is VALID [2018-11-14 16:36:38,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {8866#true} assume true; {8866#true} is VALID [2018-11-14 16:36:38,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8866#true} {8866#true} #221#return; {8866#true} is VALID [2018-11-14 16:36:38,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {8866#true} call #t~ret25 := main(); {8866#true} is VALID [2018-11-14 16:36:38,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {8866#true} ~min~0 := 3bv32;~max~0 := 5bv32;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#head~1.base, ~#head~1.offset, 4bv32);~i~0 := ~min~0; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,055 INFO L273 TraceCheckUtils]: 9: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,060 INFO L273 TraceCheckUtils]: 16: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,060 INFO L273 TraceCheckUtils]: 17: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !!~bvsle32(~i~0, ~max~0);~j~0 := 0bv32; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,061 INFO L273 TraceCheckUtils]: 18: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,062 INFO L273 TraceCheckUtils]: 19: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !(~bvslt32(~j~0, 10bv32) && #t~nondet17 != 0bv32);havoc #t~nondet17; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #t~post15 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,064 INFO L273 TraceCheckUtils]: 21: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume true; {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} assume !~bvsle32(~i~0, ~max~0); {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} is VALID [2018-11-14 16:36:38,066 INFO L256 TraceCheckUtils]: 23: Hoare triple {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {8941#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:36:38,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {8941#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {8945#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 16:36:38,068 INFO L256 TraceCheckUtils]: 25: Hoare triple {8945#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {8941#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:36:38,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {8941#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8bv32);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {8952#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1))) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 16:36:38,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {8952#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1))) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} assume !(0bv32 == ~new_node~0.base && 0bv32 == ~new_node~0.offset); {8952#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1))) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 16:36:38,072 INFO L256 TraceCheckUtils]: 28: Hoare triple {8952#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1))) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {8941#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:36:38,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {8941#(= |#valid| |old(#valid)|)} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {8941#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:36:38,073 INFO L273 TraceCheckUtils]: 30: Hoare triple {8941#(= |#valid| |old(#valid)|)} assume true; {8941#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 16:36:38,075 INFO L273 TraceCheckUtils]: 31: Hoare triple {8941#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} is VALID [2018-11-14 16:36:38,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} is VALID [2018-11-14 16:36:38,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} is VALID [2018-11-14 16:36:38,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} assume true; {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} is VALID [2018-11-14 16:36:38,080 INFO L273 TraceCheckUtils]: 35: Hoare triple {8968#(exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {8981#(and (not (= (_ bv0 32) sll_create_~new_head~0.base)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1))))))} is VALID [2018-11-14 16:36:38,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {8981#(and (not (= (_ bv0 32) sll_create_~new_head~0.base)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1))))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {8981#(and (not (= (_ bv0 32) sll_create_~new_head~0.base)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1))))))} is VALID [2018-11-14 16:36:38,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {8981#(and (not (= (_ bv0 32) sll_create_~new_head~0.base)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1))))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {8988#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,085 INFO L273 TraceCheckUtils]: 38: Hoare triple {8988#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} assume true; {8988#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,087 INFO L273 TraceCheckUtils]: 39: Hoare triple {8988#(and (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= |#valid| (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {8995#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,088 INFO L273 TraceCheckUtils]: 40: Hoare triple {8995#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {8995#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {8995#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) sll_create_~new_head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {9002#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,093 INFO L273 TraceCheckUtils]: 42: Hoare triple {9002#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} assume true; {9002#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {9002#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} assume !~bvsgt32(~len, 0bv32); {9002#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} is VALID [2018-11-14 16:36:38,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {9002#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv1 1)) sll_create_~head~0.base) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {9012#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:36:38,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {9012#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {9012#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:36:38,101 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {9012#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store (store |old(#valid)| |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv1 1)) |sll_create_#res.base|) (_ bv0 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) (_ bv0 1)))) (= |sll_create_#res.offset| (_ bv0 32)))} {8952#(and (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1))) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} #209#return; {9019#(and (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (_ bv0 1) (select (store (store (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#t~ret5.base|) (_ bv0 32)) (_ bv1 1)) |node_create_with_sublist_#t~ret5.base|)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#t~ret5.base|) (_ bv0 32)))) (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (_ bv0 32) |node_create_with_sublist_#t~ret5.offset|) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} is VALID [2018-11-14 16:36:38,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {9019#(and (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (_ bv0 1) (select (store (store (store |old(#valid)| node_create_with_sublist_~new_node~0.base (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#t~ret5.base|) (_ bv0 32)) (_ bv1 1)) |node_create_with_sublist_#t~ret5.base|)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#t~ret5.base|) (_ bv0 32)))) (= node_create_with_sublist_~new_node~0.offset (_ bv0 32)) (= (_ bv0 32) |node_create_with_sublist_#t~ret5.offset|) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) (_ bv0 1)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0bv32, 0bv32, ~new_node~0.base, ~new_node~0.offset, 4bv32);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {9023#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base|)))) (= (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} is VALID [2018-11-14 16:36:38,108 INFO L273 TraceCheckUtils]: 48: Hoare triple {9023#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base|)))) (= (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} assume true; {9023#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base|)))) (= (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} is VALID [2018-11-14 16:36:38,112 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {9023#(and (= |node_create_with_sublist_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32))))) (= (_ bv0 1) (select (store |old(#valid)| |node_create_with_sublist_#res.base| (_ bv1 1)) |sll_create_#t~malloc2.base|)))) (= (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (bvadd |node_create_with_sublist_#res.offset| (_ bv4 32)))) (= (select |old(#valid)| |node_create_with_sublist_#res.base|) (_ bv0 1)))} {8945#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #219#return; {9030#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) (_ bv4 32)) (_ bv0 32)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store |old(#valid)| |sll_append_#t~ret8.base| (_ bv1 1)) |sll_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store (store (store |old(#valid)| |sll_append_#t~ret8.base| (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32))) (_ bv0 1)))) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv0 32)) (_ bv0 32)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret8.offset|) (= (_ bv0 1) (select |old(#valid)| |sll_append_#t~ret8.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32))) (_ bv0 32)))))} is VALID [2018-11-14 16:36:38,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {9030#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) (_ bv4 32)) (_ bv0 32)) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select (store |old(#valid)| |sll_append_#t~ret8.base| (_ bv1 1)) |sll_create_#t~malloc2.base|) (_ bv0 1)) (= (select (store (store (store |old(#valid)| |sll_append_#t~ret8.base| (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32))) (_ bv0 1)))) (= sll_append_~head.base |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv0 32)) (_ bv0 32)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret8.offset|) (= (_ bv0 1) (select |old(#valid)| |sll_append_#t~ret8.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) (_ bv4 32))) (_ bv0 32)))))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0bv32, 0bv32, ~new_last~0.base, ~new_last~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {9034#(and (= (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset) sll_append_~temp~0.base) (= sll_append_~head.base |sll_append_#in~head.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) (_ bv4 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| sll_append_~new_last~0.base (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (_ bv0 1) (select (store (store (store |old(#valid)| sll_append_~new_last~0.base (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32)))))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (= sll_append_~new_last~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:36:38,129 INFO L273 TraceCheckUtils]: 51: Hoare triple {9034#(and (= (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| sll_append_~new_last~0.base)) (= (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset) sll_append_~temp~0.base) (= sll_append_~head.base |sll_append_#in~head.base|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) (_ bv4 32))) (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| sll_append_~new_last~0.base (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (_ bv0 1) (select (store (store (store |old(#valid)| sll_append_~new_last~0.base (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32)))))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) (_ bv0 32)) (= sll_append_~new_last~0.offset (_ bv0 32)))} assume !(0bv32 != ~temp~0.base || 0bv32 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {9038#(or (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (_ bv0 32)) (_ bv0 32)) (_ bv1 1)) (_ bv0 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 1)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (_ bv0 32) |sll_append_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (exists ((v_prenex_8 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8)) (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8 (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))))))) (and (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|))))} is VALID [2018-11-14 16:36:38,133 INFO L273 TraceCheckUtils]: 52: Hoare triple {9038#(or (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (_ bv0 32)) (_ bv0 32)) (_ bv1 1)) (_ bv0 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 1)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (_ bv0 32) |sll_append_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (exists ((v_prenex_8 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8)) (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8 (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))))))) (and (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|))))} assume true; {9038#(or (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (_ bv0 32)) (_ bv0 32)) (_ bv1 1)) (_ bv0 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 1)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (_ bv0 32) |sll_append_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (exists ((v_prenex_8 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8)) (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8 (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))))))) (and (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|))))} is VALID [2018-11-14 16:36:38,144 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {9038#(or (and (= (_ bv4 32) |sll_append_#in~head.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 32))) (and (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (_ bv0 32)) (_ bv0 32)) (_ bv1 1)) (_ bv0 32))) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_6)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (exists ((|sll_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base|)) (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) |sll_create_#t~malloc2.base| (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 1)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |sll_append_#in~head.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (not (= (_ bv0 32) |sll_append_#in~head.offset|)) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (exists ((v_prenex_8 (_ BitVec 32))) (and (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8)) (= (_ bv0 1) (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_8 (_ bv1 1)) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))))))) (and (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7 (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv1 1)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 1)) (= (_ bv0 1) (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) (_ bv1 1)) v_prenex_7)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32))) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv4 32)) |sll_append_#in~head.base|))))} {8886#(and (= |main_~#head~1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#head~1.base|)))} #213#return; {9045#(and (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32))) (_ bv0 32)))) (= |main_~#head~1.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:38,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {9045#(and (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32))) (_ bv0 32)))) (= |main_~#head~1.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv4 32))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) (_ bv0 32)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~i~0 := ~min~0; {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} is VALID [2018-11-14 16:36:38,148 INFO L273 TraceCheckUtils]: 55: Hoare triple {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} assume true; {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} is VALID [2018-11-14 16:36:38,149 INFO L273 TraceCheckUtils]: 56: Hoare triple {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} assume !!(0bv32 != ~ptr~0.base || 0bv32 != ~ptr~0.offset); {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} is VALID [2018-11-14 16:36:38,150 INFO L273 TraceCheckUtils]: 57: Hoare triple {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} assume !~bvsgt32(~i~0, ~max~0); {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} is VALID [2018-11-14 16:36:38,151 INFO L273 TraceCheckUtils]: 58: Hoare triple {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} assume true; {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} is VALID [2018-11-14 16:36:38,154 INFO L273 TraceCheckUtils]: 59: Hoare triple {9049#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) (_ bv0 32)) main_~ptr~0.offset)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {9065#(and (= (_ bv0 32) |main_#t~mem20.offset|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,157 INFO L256 TraceCheckUtils]: 60: Hoare triple {9065#(and (= (_ bv0 32) |main_#t~mem20.offset|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} call #t~ret21 := sll_length(#t~mem20.base, #t~mem20.offset); {9069#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32))))))} is VALID [2018-11-14 16:36:38,158 INFO L273 TraceCheckUtils]: 61: Hoare triple {9069#(exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32))))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {9073#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,160 INFO L273 TraceCheckUtils]: 62: Hoare triple {9073#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} assume true; {9073#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {9073#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post6 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {9080#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,189 INFO L273 TraceCheckUtils]: 64: Hoare triple {9080#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} assume true; {9080#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,191 INFO L273 TraceCheckUtils]: 65: Hoare triple {9080#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {9087#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,191 INFO L273 TraceCheckUtils]: 66: Hoare triple {9087#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} #res := ~len~0; {9087#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {9087#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} assume true; {9087#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} is VALID [2018-11-14 16:36:38,194 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {9087#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} {9065#(and (= (_ bv0 32) |main_#t~mem20.offset|) (exists ((|main_~#head~1.base| (_ BitVec 32))) (and (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32)))) (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) (_ bv0 32))) (_ bv4 32))) (_ bv0 32)))))))} #215#return; {8867#false} is VALID [2018-11-14 16:36:38,195 INFO L273 TraceCheckUtils]: 69: Hoare triple {8867#false} ~count~0 := #t~ret21;havoc #t~mem20.base, #t~mem20.offset;havoc #t~ret21; {8867#false} is VALID [2018-11-14 16:36:38,195 INFO L273 TraceCheckUtils]: 70: Hoare triple {8867#false} assume !(~i~0 == ~count~0); {8867#false} is VALID [2018-11-14 16:36:38,195 INFO L273 TraceCheckUtils]: 71: Hoare triple {8867#false} assume !(3bv32 == ~i~0 && 5bv32 == ~count~0); {8867#false} is VALID [2018-11-14 16:36:38,195 INFO L273 TraceCheckUtils]: 72: Hoare triple {8867#false} assume !(~bvadd32(1bv32, ~i~0) == ~count~0 && ~bvslt32(~i~0, ~max~0)); {8867#false} is VALID [2018-11-14 16:36:38,196 INFO L273 TraceCheckUtils]: 73: Hoare triple {8867#false} assume !false; {8867#false} is VALID [2018-11-14 16:36:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 10 not checked. [2018-11-14 16:36:38,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:41,227 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 16:36:41,786 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-14 16:36:42,001 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-14 16:36:42,180 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-14 16:36:42,352 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-14 16:36:45,280 WARN L179 SmtUtils]: Spent 2.90 s on a formula simplification that was a NOOP. DAG size: 89 [2018-11-14 16:36:46,419 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 58 [2018-11-14 16:36:47,458 WARN L179 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-14 16:36:48,538 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-14 16:36:50,987 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-14 16:36:51,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 130 [2018-11-14 16:36:51,202 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 16:36:51,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 16:36:51,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:51,307 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 116 [2018-11-14 16:36:51,564 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2018-11-14 16:36:51,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-11-14 16:36:51,803 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-14 16:36:51,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:51,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 85 [2018-11-14 16:36:51,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:51,830 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-14 16:36:51,835 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:51,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:51,914 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,915 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:51,917 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,918 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,918 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:51,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 101 [2018-11-14 16:36:51,958 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,034 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 120 [2018-11-14 16:36:52,045 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:36:52,192 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-11-14 16:36:52,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,350 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 139 [2018-11-14 16:36:52,392 INFO L267 ElimStorePlain]: Start of recursive call 11: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-11-14 16:36:52,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-14 16:36:52,473 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,485 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-11-14 16:36:52,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,538 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 28 [2018-11-14 16:36:52,548 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:36:52,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,592 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-14 16:36:52,623 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,648 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-11-14 16:36:52,723 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 35 [2018-11-14 16:36:52,748 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-11-14 16:36:52,784 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,785 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:36:52,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:52,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-14 16:36:52,795 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,807 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:52,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:36:52,895 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:239, output treesize:35 [2018-11-14 16:36:52,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:53,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:36:53,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:36:53,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:36:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:53,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:53,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:36:53,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:53,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:53,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 16:36:53,212 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:37:01,121 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 19