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_length_check_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:35:51,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:35:51,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:35:51,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:35:51,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:35:51,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:35:51,602 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:35:51,604 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:35:51,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:35:51,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:35:51,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:35:51,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:35:51,609 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:35:51,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:35:51,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:35:51,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:35:51,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:35:51,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:35:51,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:35:51,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:35:51,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:35:51,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:35:51,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:35:51,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:35:51,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:35:51,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:35:51,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:35:51,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:35:51,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:35:51,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:35:51,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:35:51,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:35:51,636 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:35:51,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:35:51,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:35:51,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:35:51,641 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:51,668 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:35:51,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:35:51,670 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:35:51,670 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:35:51,670 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:35:51,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:35:51,675 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:35:51,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:35:51,675 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:35:51,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:35:51,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:35:51,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:35:51,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:35:51,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:35:51,677 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:35:51,677 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:35:51,677 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:35:51,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:35:51,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:35:51,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:35:51,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:35:51,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:35:51,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:35:51,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:35:51,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:35:51,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:35:51,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:35:51,681 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:35:51,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:35:51,681 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:35:51,681 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:35:51,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:35:51,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:35:51,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:35:51,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:35:51,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:35:51,778 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:35:51,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:35:51,848 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0ec3f07/7839a4bfeb07466295ba5b26dffe1a30/FLAG624b19215 [2018-11-14 16:35:52,419 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:35:52,419 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:35:52,441 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0ec3f07/7839a4bfeb07466295ba5b26dffe1a30/FLAG624b19215 [2018-11-14 16:35:52,457 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0ec3f07/7839a4bfeb07466295ba5b26dffe1a30 [2018-11-14 16:35:52,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:35:52,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:35:52,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:52,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:35:52,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:35:52,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:52" (1/1) ... [2018-11-14 16:35:52,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445fe728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:52, skipping insertion in model container [2018-11-14 16:35:52,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:52" (1/1) ... [2018-11-14 16:35:52,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:35:52,541 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:35:53,044 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:53,058 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:35:53,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:53,287 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:35:53,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:53 WrapperNode [2018-11-14 16:35:53,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:53,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:35:53,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:35:53,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:35:53,304 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:53" (1/1) ... [2018-11-14 16:35:53,304 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:53" (1/1) ... [2018-11-14 16:35:53,330 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:53" (1/1) ... [2018-11-14 16:35:53,330 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:53" (1/1) ... [2018-11-14 16:35:53,364 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:53" (1/1) ... [2018-11-14 16:35:53,378 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:53" (1/1) ... [2018-11-14 16:35:53,386 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:53" (1/1) ... [2018-11-14 16:35:53,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:35:53,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:35:53,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:35:53,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:35:53,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:53" (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:53,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:35:53,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:35:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:35:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:35:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:35:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 16:35:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-14 16:35:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-14 16:35:53,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:35:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:35:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:35:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:35:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:35:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:35:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:35:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:35:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:35:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:35:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:35:53,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:35:53,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:35:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:35:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:35:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:35:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:35:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:35:53,468 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:35:53,469 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:35:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:35:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:35:53,472 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:35:53,473 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:35:53,474 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:35:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:35:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:35:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:35:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:35:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:35:53,475 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:35:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:35:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:35:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:35:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:35:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:35:53,476 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:35:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:35:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:35:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:35:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:35:53,477 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:35:53,478 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:35:53,478 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:35:53,478 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:35:53,478 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:35:53,478 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:35:53,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:35:53,479 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:35:53,479 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:35:53,479 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:35:53,479 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:35:53,479 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:35:53,479 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:35:53,481 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:35:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:35:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:35:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:35:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:35:53,482 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:35:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:35:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 16:35:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:35:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:35:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-14 16:35:53,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:35:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-14 16:35:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:35:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:35:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:35:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:35:54,544 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:35:54,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:54 BoogieIcfgContainer [2018-11-14 16:35:54,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:35:54,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:35:54,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:35:54,549 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:35:54,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:35:52" (1/3) ... [2018-11-14 16:35:54,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd06a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:54, skipping insertion in model container [2018-11-14 16:35:54,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:53" (2/3) ... [2018-11-14 16:35:54,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd06a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:54, skipping insertion in model container [2018-11-14 16:35:54,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:54" (3/3) ... [2018-11-14 16:35:54,553 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:35:54,563 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:35:54,573 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:35:54,590 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:35:54,621 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:35:54,622 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:35:54,622 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:35:54,623 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:35:54,623 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:35:54,623 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:35:54,623 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:35:54,624 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:35:54,624 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:35:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 16:35:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:35:54,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:54,652 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] [2018-11-14 16:35:54,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:54,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1413814521, now seen corresponding path program 1 times [2018-11-14 16:35:54,666 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:54,667 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:54,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:54,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:54,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 16:35:54,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 16:35:54,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 16:35:54,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #104#return; {45#true} is VALID [2018-11-14 16:35:54,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret11 := main(); {45#true} is VALID [2018-11-14 16:35:54,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} ~len~1 := 2bv32; {45#true} is VALID [2018-11-14 16:35:55,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 16:35:55,009 INFO L256 TraceCheckUtils]: 7: Hoare triple {46#false} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {46#false} is VALID [2018-11-14 16:35:55,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {46#false} is VALID [2018-11-14 16:35:55,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:35:55,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {46#false} is VALID [2018-11-14 16:35:55,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 16:35:55,011 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {46#false} {46#false} #98#return; {46#false} is VALID [2018-11-14 16:35:55,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {46#false} is VALID [2018-11-14 16:35:55,012 INFO L256 TraceCheckUtils]: 14: Hoare triple {46#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {46#false} is VALID [2018-11-14 16:35:55,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {46#false} is VALID [2018-11-14 16:35:55,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:35:55,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} #res := ~len~0; {46#false} is VALID [2018-11-14 16:35:55,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 16:35:55,013 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {46#false} {46#false} #100#return; {46#false} is VALID [2018-11-14 16:35:55,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {46#false} is VALID [2018-11-14 16:35:55,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 16:35:55,019 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:55,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:55,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:55,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:35:55,031 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:35:55,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:55,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:35:55,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:35:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:35:55,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:35:55,189 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 16:35:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:55,936 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-11-14 16:35:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:35:55,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:35:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2018-11-14 16:35:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2018-11-14 16:35:55,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 93 transitions. [2018-11-14 16:35:56,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:56,506 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:35:56,506 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:35:56,510 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:35:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:35:56,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:56,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:56,556 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:56,557 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:56,563 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 16:35:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:35:56,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:56,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:56,564 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:56,564 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:56,569 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 16:35:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:35:56,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:56,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:56,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:56,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:35:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 16:35:56,575 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-14 16:35:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:56,576 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 16:35:56,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:35:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:35:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:35:56,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:56,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:56,578 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:56,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1783847450, now seen corresponding path program 1 times [2018-11-14 16:35:56,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:56,579 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:56,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:56,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:56,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {313#true} is VALID [2018-11-14 16:35:56,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {313#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {313#true} is VALID [2018-11-14 16:35:56,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2018-11-14 16:35:56,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #104#return; {313#true} is VALID [2018-11-14 16:35:56,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret11 := main(); {313#true} is VALID [2018-11-14 16:35:56,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {313#true} ~len~1 := 2bv32; {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:56,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:56,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:56,839 INFO L256 TraceCheckUtils]: 8: Hoare triple {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {313#true} is VALID [2018-11-14 16:35:56,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {313#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {346#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:56,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {346#(= |sll_create_#in~len| sll_create_~len)} assume true; {346#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:56,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {346#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {353#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:56,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {353#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {353#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:56,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {353#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {353#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:56,856 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {353#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {314#false} is VALID [2018-11-14 16:35:56,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {314#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {314#false} is VALID [2018-11-14 16:35:56,857 INFO L256 TraceCheckUtils]: 16: Hoare triple {314#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {314#false} is VALID [2018-11-14 16:35:56,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {314#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {314#false} is VALID [2018-11-14 16:35:56,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {314#false} assume true; {314#false} is VALID [2018-11-14 16:35:56,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {314#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {314#false} is VALID [2018-11-14 16:35:56,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {314#false} #res := ~len~0; {314#false} is VALID [2018-11-14 16:35:56,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {314#false} assume true; {314#false} is VALID [2018-11-14 16:35:56,859 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {314#false} {314#false} #100#return; {314#false} is VALID [2018-11-14 16:35:56,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {314#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {314#false} is VALID [2018-11-14 16:35:56,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {314#false} assume !false; {314#false} is VALID [2018-11-14 16:35:56,863 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:56,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:56,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:56,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:35:56,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 16:35:56,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:56,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:35:56,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:56,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:35:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:35:56,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:35:56,937 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2018-11-14 16:35:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:57,519 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 16:35:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:35:57,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 16:35:57,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:35:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 16:35:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:35:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 16:35:57,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-14 16:35:57,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:57,705 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:35:57,706 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 16:35:57,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:35:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 16:35:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-14 16:35:57,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:57,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 36 states. [2018-11-14 16:35:57,750 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 36 states. [2018-11-14 16:35:57,750 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 36 states. [2018-11-14 16:35:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:57,757 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 16:35:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 16:35:57,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:57,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:57,759 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 43 states. [2018-11-14 16:35:57,759 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 43 states. [2018-11-14 16:35:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:57,764 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 16:35:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 16:35:57,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:57,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:57,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:57,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:35:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-14 16:35:57,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2018-11-14 16:35:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:57,770 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-14 16:35:57,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:35:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-14 16:35:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:35:57,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:57,772 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] [2018-11-14 16:35:57,772 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:57,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1176066432, now seen corresponding path program 1 times [2018-11-14 16:35:57,773 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:57,773 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:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:57,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:57,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID [2018-11-14 16:35:57,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {606#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {606#true} is VALID [2018-11-14 16:35:57,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:57,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {606#true} {606#true} #104#return; {606#true} is VALID [2018-11-14 16:35:57,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {606#true} call #t~ret11 := main(); {606#true} is VALID [2018-11-14 16:35:57,994 INFO L273 TraceCheckUtils]: 5: Hoare triple {606#true} ~len~1 := 2bv32; {626#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:57,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {626#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {626#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:57,996 INFO L273 TraceCheckUtils]: 7: Hoare triple {626#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:57,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:57,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:57,997 INFO L256 TraceCheckUtils]: 10: Hoare triple {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {606#true} is VALID [2018-11-14 16:35:57,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {646#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:57,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#(= |sll_create_#in~len| sll_create_~len)} assume true; {646#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:58,000 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,004 INFO L273 TraceCheckUtils]: 15: Hoare triple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,009 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} #98#return; {607#false} is VALID [2018-11-14 16:35:58,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {607#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {607#false} is VALID [2018-11-14 16:35:58,009 INFO L256 TraceCheckUtils]: 18: Hoare triple {607#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {607#false} is VALID [2018-11-14 16:35:58,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {607#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {607#false} is VALID [2018-11-14 16:35:58,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {607#false} assume true; {607#false} is VALID [2018-11-14 16:35:58,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {607#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {607#false} is VALID [2018-11-14 16:35:58,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {607#false} #res := ~len~0; {607#false} is VALID [2018-11-14 16:35:58,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {607#false} assume true; {607#false} is VALID [2018-11-14 16:35:58,011 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {607#false} {607#false} #100#return; {607#false} is VALID [2018-11-14 16:35:58,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {607#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {607#false} is VALID [2018-11-14 16:35:58,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {607#false} assume !false; {607#false} is VALID [2018-11-14 16:35:58,014 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:58,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:58,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {607#false} assume !false; {607#false} is VALID [2018-11-14 16:35:58,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {607#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {607#false} is VALID [2018-11-14 16:35:58,367 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {606#true} {607#false} #100#return; {607#false} is VALID [2018-11-14 16:35:58,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:58,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {606#true} #res := ~len~0; {606#true} is VALID [2018-11-14 16:35:58,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {606#true} is VALID [2018-11-14 16:35:58,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:58,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {606#true} is VALID [2018-11-14 16:35:58,368 INFO L256 TraceCheckUtils]: 18: Hoare triple {607#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {606#true} is VALID [2018-11-14 16:35:58,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {607#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {607#false} is VALID [2018-11-14 16:35:58,370 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {723#(bvsgt main_~len~1 (_ bv0 32))} #98#return; {607#false} is VALID [2018-11-14 16:35:58,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {736#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:35:58,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {736#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {736#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:35:58,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {736#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:35:58,376 INFO L256 TraceCheckUtils]: 10: Hoare triple {723#(bvsgt main_~len~1 (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {606#true} is VALID [2018-11-14 16:35:58,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {723#(bvsgt main_~len~1 (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {723#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:58,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {723#(bvsgt main_~len~1 (_ bv0 32))} assume true; {723#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:58,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {752#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {723#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:58,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {752#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume true; {752#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:58,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {606#true} ~len~1 := 2bv32; {752#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:58,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {606#true} call #t~ret11 := main(); {606#true} is VALID [2018-11-14 16:35:58,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {606#true} {606#true} #104#return; {606#true} is VALID [2018-11-14 16:35:58,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:58,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {606#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {606#true} is VALID [2018-11-14 16:35:58,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID [2018-11-14 16:35:58,386 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:58,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:58,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 16:35:58,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-14 16:35:58,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:58,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:58,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:58,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:58,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:58,515 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 9 states. [2018-11-14 16:35:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:59,088 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 16:35:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:35:59,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-14 16:35:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2018-11-14 16:35:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2018-11-14 16:35:59,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 70 transitions. [2018-11-14 16:35:59,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:59,294 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:35:59,294 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 16:35:59,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:35:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 16:35:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 30. [2018-11-14 16:35:59,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:59,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 30 states. [2018-11-14 16:35:59,344 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 30 states. [2018-11-14 16:35:59,345 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 30 states. [2018-11-14 16:35:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:59,350 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 16:35:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 16:35:59,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:59,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:59,352 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 48 states. [2018-11-14 16:35:59,352 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 48 states. [2018-11-14 16:35:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:59,356 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 16:35:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 16:35:59,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:59,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:59,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:59,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:35:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 16:35:59,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-11-14 16:35:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:59,360 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 16:35:59,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:35:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 16:35:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:35:59,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:59,362 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] [2018-11-14 16:35:59,362 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:59,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 375065118, now seen corresponding path program 1 times [2018-11-14 16:35:59,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:59,363 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:59,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:59,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:59,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {1006#true} call ULTIMATE.init(); {1006#true} is VALID [2018-11-14 16:35:59,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {1006#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1006#true} is VALID [2018-11-14 16:35:59,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 16:35:59,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1006#true} {1006#true} #104#return; {1006#true} is VALID [2018-11-14 16:35:59,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {1006#true} call #t~ret11 := main(); {1006#true} is VALID [2018-11-14 16:35:59,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {1006#true} ~len~1 := 2bv32; {1006#true} is VALID [2018-11-14 16:35:59,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 16:35:59,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {1006#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1006#true} is VALID [2018-11-14 16:35:59,641 INFO L256 TraceCheckUtils]: 8: Hoare triple {1006#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {1006#true} is VALID [2018-11-14 16:35:59,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {1006#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1006#true} is VALID [2018-11-14 16:35:59,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 16:35:59,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {1006#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1044#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:35:59,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {1044#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1044#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:35:59,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {1044#(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; {1051#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:35:59,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {1051#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {1051#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:35:59,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {1051#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {1051#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:35:59,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {1051#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1061#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:35:59,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {1061#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {1061#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-14 16:35:59,655 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1061#(not (= (_ bv0 32) |sll_create_#res.base|))} {1006#true} #98#return; {1068#(not (= (_ bv0 32) |main_#t~ret9.base|))} is VALID [2018-11-14 16:35:59,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {1068#(not (= (_ bv0 32) |main_#t~ret9.base|))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1072#(not (= (_ bv0 32) main_~s~0.base))} is VALID [2018-11-14 16:35:59,657 INFO L256 TraceCheckUtils]: 20: Hoare triple {1072#(not (= (_ bv0 32) main_~s~0.base))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1006#true} is VALID [2018-11-14 16:35:59,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {1006#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1079#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:59,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {1079#(= sll_length_~head.base |sll_length_#in~head.base|)} assume true; {1079#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:59,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {1079#(= sll_length_~head.base |sll_length_#in~head.base|)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1086#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:59,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {1086#(= (_ bv0 32) |sll_length_#in~head.base|)} #res := ~len~0; {1086#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:59,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {1086#(= (_ bv0 32) |sll_length_#in~head.base|)} assume true; {1086#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-14 16:35:59,678 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1086#(= (_ bv0 32) |sll_length_#in~head.base|)} {1072#(not (= (_ bv0 32) main_~s~0.base))} #100#return; {1007#false} is VALID [2018-11-14 16:35:59,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {1007#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1007#false} is VALID [2018-11-14 16:35:59,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {1007#false} assume !false; {1007#false} is VALID [2018-11-14 16:35:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:59,682 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:35:59,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:59,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:35:59,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-14 16:35:59,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:59,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:59,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:59,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:59,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:59,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:59,741 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-14 16:36:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:00,474 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-14 16:36:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:36:00,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-14 16:36:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:36:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-14 16:36:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:36:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-14 16:36:00,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2018-11-14 16:36:00,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:00,553 INFO L225 Difference]: With dead ends: 40 [2018-11-14 16:36:00,553 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:36:00,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:36:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:36:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-14 16:36:00,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:00,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-14 16:36:00,621 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-14 16:36:00,621 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-14 16:36:00,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:00,624 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 16:36:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 16:36:00,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:00,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:00,625 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-14 16:36:00,625 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-14 16:36:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:00,627 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 16:36:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 16:36:00,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:00,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:00,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:00,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:36:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-14 16:36:00,631 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-11-14 16:36:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:00,631 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-14 16:36:00,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:36:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-14 16:36:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:36:00,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:00,632 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:36:00,633 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:00,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1699724744, now seen corresponding path program 1 times [2018-11-14 16:36:00,633 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:00,634 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:36:00,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:36:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:00,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:00,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 16:36:00,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1277#true} is VALID [2018-11-14 16:36:00,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:36:00,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #104#return; {1277#true} is VALID [2018-11-14 16:36:00,840 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret11 := main(); {1277#true} is VALID [2018-11-14 16:36:00,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} ~len~1 := 2bv32; {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:00,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:00,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:00,843 INFO L256 TraceCheckUtils]: 8: Hoare triple {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {1277#true} is VALID [2018-11-14 16:36:00,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {1277#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1310#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:00,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {1310#(= |sll_create_#in~len| sll_create_~len)} assume true; {1310#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:00,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {1310#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1310#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:00,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {1310#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1310#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:00,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(= |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; {1323#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:00,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {1323#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {1323#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:00,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {1323#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:00,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:00,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:00,855 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {1278#false} is VALID [2018-11-14 16:36:00,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1278#false} is VALID [2018-11-14 16:36:00,855 INFO L256 TraceCheckUtils]: 20: Hoare triple {1278#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1278#false} is VALID [2018-11-14 16:36:00,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1278#false} is VALID [2018-11-14 16:36:00,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 16:36:00,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {1278#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1278#false} is VALID [2018-11-14 16:36:00,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 16:36:00,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {1278#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1278#false} is VALID [2018-11-14 16:36:00,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#false} #res := ~len~0; {1278#false} is VALID [2018-11-14 16:36:00,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 16:36:00,857 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1278#false} {1278#false} #100#return; {1278#false} is VALID [2018-11-14 16:36:00,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1278#false} is VALID [2018-11-14 16:36:00,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 16:36:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:36:00,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:01,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 16:36:01,101 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1278#false} is VALID [2018-11-14 16:36:01,102 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1277#true} {1278#false} #100#return; {1278#false} is VALID [2018-11-14 16:36:01,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:36:01,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#true} #res := ~len~0; {1277#true} is VALID [2018-11-14 16:36:01,103 INFO L273 TraceCheckUtils]: 25: Hoare triple {1277#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1277#true} is VALID [2018-11-14 16:36:01,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:36:01,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {1277#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1277#true} is VALID [2018-11-14 16:36:01,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:36:01,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1277#true} is VALID [2018-11-14 16:36:01,104 INFO L256 TraceCheckUtils]: 20: Hoare triple {1278#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1277#true} is VALID [2018-11-14 16:36:01,104 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1278#false} is VALID [2018-11-14 16:36:01,108 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} #98#return; {1278#false} is VALID [2018-11-14 16:36:01,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:01,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:01,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {1425#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:01,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {1425#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {1425#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:36:01,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {1432#(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; {1425#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:36:01,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {1432#(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); {1432#(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:36:01,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {1432#(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(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1432#(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:36:01,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {1432#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1432#(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:36:01,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {1277#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1432#(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:36:01,121 INFO L256 TraceCheckUtils]: 8: Hoare triple {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {1277#true} is VALID [2018-11-14 16:36:01,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:01,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:01,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} ~len~1 := 2bv32; {1412#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:01,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret11 := main(); {1277#true} is VALID [2018-11-14 16:36:01,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #104#return; {1277#true} is VALID [2018-11-14 16:36:01,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:36:01,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1277#true} is VALID [2018-11-14 16:36:01,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 16:36:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:36:01,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 16:36:01,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 16:36:01,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:01,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:36:01,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:01,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:36:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:36:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:36:01,237 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-11-14 16:36:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:02,208 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-14 16:36:02,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:36:02,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 16:36:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:36:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-11-14 16:36:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:36:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2018-11-14 16:36:02,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2018-11-14 16:36:02,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:02,355 INFO L225 Difference]: With dead ends: 70 [2018-11-14 16:36:02,355 INFO L226 Difference]: Without dead ends: 57 [2018-11-14 16:36:02,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:36:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-14 16:36:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-11-14 16:36:02,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:02,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 44 states. [2018-11-14 16:36:02,391 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 44 states. [2018-11-14 16:36:02,391 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 44 states. [2018-11-14 16:36:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:02,395 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-14 16:36:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-14 16:36:02,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:02,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:02,396 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 57 states. [2018-11-14 16:36:02,396 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 57 states. [2018-11-14 16:36:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:02,400 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-14 16:36:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-11-14 16:36:02,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:02,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:02,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:02,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:36:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-14 16:36:02,405 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 31 [2018-11-14 16:36:02,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:02,405 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-14 16:36:02,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:36:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 16:36:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:36:02,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:02,407 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 16:36:02,407 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:02,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash -496984976, now seen corresponding path program 2 times [2018-11-14 16:36:02,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:02,408 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:36:02,437 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:36:02,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:36:02,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:36:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:02,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:02,661 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:02,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:36:02,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:02,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:02,697 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:36:02,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-14 16:36:02,708 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:03,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {1749#true} call ULTIMATE.init(); {1749#true} is VALID [2018-11-14 16:36:03,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {1749#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1749#true} is VALID [2018-11-14 16:36:03,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {1749#true} assume true; {1749#true} is VALID [2018-11-14 16:36:03,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1749#true} {1749#true} #104#return; {1749#true} is VALID [2018-11-14 16:36:03,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {1749#true} call #t~ret11 := main(); {1749#true} is VALID [2018-11-14 16:36:03,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {1749#true} ~len~1 := 2bv32; {1749#true} is VALID [2018-11-14 16:36:03,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {1749#true} assume true; {1749#true} is VALID [2018-11-14 16:36:03,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {1749#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1749#true} is VALID [2018-11-14 16:36:03,205 INFO L256 TraceCheckUtils]: 8: Hoare triple {1749#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {1749#true} is VALID [2018-11-14 16:36:03,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {1749#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1749#true} is VALID [2018-11-14 16:36:03,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {1749#true} assume true; {1749#true} is VALID [2018-11-14 16:36:03,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {1749#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1787#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:03,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {1787#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1787#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:03,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {1787#(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; {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:03,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:03,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:03,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:03,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {1794#(not (= sll_create_~head~0.base (_ 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; {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:03,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume true; {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:03,217 INFO L273 TraceCheckUtils]: 19: Hoare triple {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !~bvsgt32(~len, 0bv32); {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:03,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:03,218 INFO L273 TraceCheckUtils]: 21: Hoare triple {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} assume true; {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:03,219 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} {1749#true} #98#return; {1824#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)))} is VALID [2018-11-14 16:36:03,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {1824#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-14 16:36:03,224 INFO L256 TraceCheckUtils]: 24: Hoare triple {1828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1832#(exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1))))} is VALID [2018-11-14 16:36:03,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {1832#(exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1836#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 16:36:03,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {1836#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume true; {1836#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 16:36:03,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {1836#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1843#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} is VALID [2018-11-14 16:36:03,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {1843#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} assume true; {1843#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} is VALID [2018-11-14 16:36:03,228 INFO L273 TraceCheckUtils]: 29: Hoare triple {1843#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1850#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:03,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {1850#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} #res := ~len~0; {1850#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:03,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {1850#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} assume true; {1850#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:03,231 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1850#(and (exists ((v_main_~s~0.offset_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_1)))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} {1828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #100#return; {1750#false} is VALID [2018-11-14 16:36:03,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {1750#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1750#false} is VALID [2018-11-14 16:36:03,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {1750#false} assume !false; {1750#false} is VALID [2018-11-14 16:36:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:36:03,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:04,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {1750#false} assume !false; {1750#false} is VALID [2018-11-14 16:36:04,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {1750#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1750#false} is VALID [2018-11-14 16:36:04,023 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1875#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} {1828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #100#return; {1750#false} is VALID [2018-11-14 16:36:04,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {1875#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} assume true; {1875#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-14 16:36:04,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {1875#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} #res := ~len~0; {1875#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-14 16:36:04,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {1885#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1875#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-14 16:36:04,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {1885#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} assume true; {1885#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} is VALID [2018-11-14 16:36:04,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {1892#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1885#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} is VALID [2018-11-14 16:36:04,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {1892#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} assume true; {1892#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:04,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {1749#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1892#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:04,027 INFO L256 TraceCheckUtils]: 24: Hoare triple {1828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1749#true} is VALID [2018-11-14 16:36:04,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {1824#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-14 16:36:04,030 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} {1749#true} #98#return; {1824#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)))} is VALID [2018-11-14 16:36:04,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} assume true; {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:04,031 INFO L273 TraceCheckUtils]: 20: Hoare triple {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1817#(not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:36:04,032 INFO L273 TraceCheckUtils]: 19: Hoare triple {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !~bvsgt32(~len, 0bv32); {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:04,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume true; {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:04,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {1794#(not (= sll_create_~head~0.base (_ 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; {1807#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:04,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:04,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:04,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:04,038 INFO L273 TraceCheckUtils]: 13: Hoare triple {1787#(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; {1794#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:04,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {1787#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1787#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:04,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {1749#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1787#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:04,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {1749#true} assume true; {1749#true} is VALID [2018-11-14 16:36:04,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {1749#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1749#true} is VALID [2018-11-14 16:36:04,041 INFO L256 TraceCheckUtils]: 8: Hoare triple {1749#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {1749#true} is VALID [2018-11-14 16:36:04,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {1749#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1749#true} is VALID [2018-11-14 16:36:04,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {1749#true} assume true; {1749#true} is VALID [2018-11-14 16:36:04,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1749#true} ~len~1 := 2bv32; {1749#true} is VALID [2018-11-14 16:36:04,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {1749#true} call #t~ret11 := main(); {1749#true} is VALID [2018-11-14 16:36:04,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1749#true} {1749#true} #104#return; {1749#true} is VALID [2018-11-14 16:36:04,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {1749#true} assume true; {1749#true} is VALID [2018-11-14 16:36:04,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {1749#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1749#true} is VALID [2018-11-14 16:36:04,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {1749#true} call ULTIMATE.init(); {1749#true} is VALID [2018-11-14 16:36:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:36:04,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:04,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-11-14 16:36:04,048 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-14 16:36:04,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:04,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:36:04,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:04,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:36:04,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:36:04,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:36:04,113 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 15 states. [2018-11-14 16:36:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:15,802 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-14 16:36:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:36:15,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-11-14 16:36:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:36:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2018-11-14 16:36:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:36:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2018-11-14 16:36:15,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 71 transitions. [2018-11-14 16:36:15,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:15,964 INFO L225 Difference]: With dead ends: 72 [2018-11-14 16:36:15,964 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 16:36:15,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:36:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 16:36:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-11-14 16:36:16,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:16,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 56 states. [2018-11-14 16:36:16,016 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 56 states. [2018-11-14 16:36:16,017 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 56 states. [2018-11-14 16:36:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:16,021 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-14 16:36:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 16:36:16,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:16,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:16,022 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 66 states. [2018-11-14 16:36:16,022 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 66 states. [2018-11-14 16:36:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:16,025 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-11-14 16:36:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 16:36:16,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:16,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:16,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:16,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 16:36:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-11-14 16:36:16,029 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 35 [2018-11-14 16:36:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:16,029 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-11-14 16:36:16,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:36:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-11-14 16:36:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:36:16,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:16,031 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-14 16:36:16,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:16,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1489054740, now seen corresponding path program 1 times [2018-11-14 16:36:16,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:16,032 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:36:16,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:36:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:16,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:16,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {2293#true} call ULTIMATE.init(); {2293#true} is VALID [2018-11-14 16:36:16,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {2293#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2293#true} is VALID [2018-11-14 16:36:16,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {2293#true} assume true; {2293#true} is VALID [2018-11-14 16:36:16,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2293#true} {2293#true} #104#return; {2293#true} is VALID [2018-11-14 16:36:16,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {2293#true} call #t~ret11 := main(); {2293#true} is VALID [2018-11-14 16:36:16,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {2293#true} ~len~1 := 2bv32; {2313#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {2313#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2313#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {2313#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2320#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {2320#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2320#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {2320#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,272 INFO L256 TraceCheckUtils]: 12: Hoare triple {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {2293#true} is VALID [2018-11-14 16:36:16,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {2293#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2340#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:16,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {2340#(= |sll_create_#in~len| sll_create_~len)} assume true; {2340#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:16,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {2340#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2340#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:16,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {2340#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2340#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:16,274 INFO L273 TraceCheckUtils]: 17: Hoare triple {2340#(= |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; {2353#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:16,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {2353#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {2353#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:16,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {2353#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:16,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:16,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:16,282 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2327#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} #98#return; {2294#false} is VALID [2018-11-14 16:36:16,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {2294#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {2294#false} is VALID [2018-11-14 16:36:16,282 INFO L256 TraceCheckUtils]: 24: Hoare triple {2294#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2294#false} is VALID [2018-11-14 16:36:16,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {2294#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2294#false} is VALID [2018-11-14 16:36:16,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {2294#false} assume true; {2294#false} is VALID [2018-11-14 16:36:16,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {2294#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {2294#false} assume true; {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {2294#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {2294#false} #res := ~len~0; {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {2294#false} assume true; {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2294#false} {2294#false} #100#return; {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {2294#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {2294#false} is VALID [2018-11-14 16:36:16,283 INFO L273 TraceCheckUtils]: 34: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2018-11-14 16:36:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:36:16,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:16,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2018-11-14 16:36:16,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {2294#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {2294#false} is VALID [2018-11-14 16:36:16,564 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2293#true} {2294#false} #100#return; {2294#false} is VALID [2018-11-14 16:36:16,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#true} assume true; {2293#true} is VALID [2018-11-14 16:36:16,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {2293#true} #res := ~len~0; {2293#true} is VALID [2018-11-14 16:36:16,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {2293#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2293#true} is VALID [2018-11-14 16:36:16,565 INFO L273 TraceCheckUtils]: 28: Hoare triple {2293#true} assume true; {2293#true} is VALID [2018-11-14 16:36:16,565 INFO L273 TraceCheckUtils]: 27: Hoare triple {2293#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2293#true} is VALID [2018-11-14 16:36:16,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {2293#true} assume true; {2293#true} is VALID [2018-11-14 16:36:16,565 INFO L273 TraceCheckUtils]: 25: Hoare triple {2293#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2293#true} is VALID [2018-11-14 16:36:16,566 INFO L256 TraceCheckUtils]: 24: Hoare triple {2294#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2293#true} is VALID [2018-11-14 16:36:16,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {2294#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {2294#false} is VALID [2018-11-14 16:36:16,571 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} #98#return; {2294#false} is VALID [2018-11-14 16:36:16,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:16,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:16,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {2455#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {2360#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:16,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {2455#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {2455#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:36:16,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {2462#(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; {2455#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:36:16,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {2462#(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); {2462#(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:36:16,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {2462#(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(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2462#(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:36:16,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {2462#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2462#(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:36:16,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {2293#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2462#(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:36:16,581 INFO L256 TraceCheckUtils]: 12: Hoare triple {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {2293#true} is VALID [2018-11-14 16:36:16,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {2484#(bvsgt main_~len~1 (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2442#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {2484#(bvsgt main_~len~1 (_ bv0 32))} assume true; {2484#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:36:16,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {2491#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2484#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:36:16,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {2491#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume true; {2491#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {2293#true} ~len~1 := 2bv32; {2491#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:16,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {2293#true} call #t~ret11 := main(); {2293#true} is VALID [2018-11-14 16:36:16,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2293#true} {2293#true} #104#return; {2293#true} is VALID [2018-11-14 16:36:16,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {2293#true} assume true; {2293#true} is VALID [2018-11-14 16:36:16,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {2293#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2293#true} is VALID [2018-11-14 16:36:16,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {2293#true} call ULTIMATE.init(); {2293#true} is VALID [2018-11-14 16:36:16,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:36:16,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:16,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-14 16:36:16,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-14 16:36:16,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:16,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:36:16,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:16,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:36:16,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:36:16,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:36:16,679 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 13 states. [2018-11-14 16:36:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:18,293 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-11-14 16:36:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:36:18,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-14 16:36:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:36:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 16:36:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:36:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 16:36:18,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 16:36:18,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:18,442 INFO L225 Difference]: With dead ends: 80 [2018-11-14 16:36:18,442 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 16:36:18,443 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:36:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 16:36:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2018-11-14 16:36:18,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:18,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 38 states. [2018-11-14 16:36:18,484 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 38 states. [2018-11-14 16:36:18,485 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 38 states. [2018-11-14 16:36:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:18,489 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-14 16:36:18,489 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-14 16:36:18,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:18,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:18,490 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 64 states. [2018-11-14 16:36:18,490 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 64 states. [2018-11-14 16:36:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:18,493 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-14 16:36:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-11-14 16:36:18,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:18,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:18,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:18,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 16:36:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 16:36:18,496 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-11-14 16:36:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:18,496 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 16:36:18,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:36:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 16:36:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:36:18,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:18,497 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-14 16:36:18,497 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:18,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2073724938, now seen corresponding path program 3 times [2018-11-14 16:36:18,498 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:18,498 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:36:18,522 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:36:18,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:36:18,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:36:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:18,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:18,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2816#true} is VALID [2018-11-14 16:36:18,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {2816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2816#true} is VALID [2018-11-14 16:36:18,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:18,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #104#return; {2816#true} is VALID [2018-11-14 16:36:18,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret11 := main(); {2816#true} is VALID [2018-11-14 16:36:18,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {2816#true} ~len~1 := 2bv32; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,781 INFO L256 TraceCheckUtils]: 8: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {2816#true} is VALID [2018-11-14 16:36:18,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {2816#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2816#true} is VALID [2018-11-14 16:36:18,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:18,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {2816#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2816#true} is VALID [2018-11-14 16:36:18,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {2816#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2816#true} is VALID [2018-11-14 16:36:18,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {2816#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; {2816#true} is VALID [2018-11-14 16:36:18,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:18,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {2816#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2816#true} is VALID [2018-11-14 16:36:18,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {2816#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2816#true} is VALID [2018-11-14 16:36:18,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {2816#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; {2816#true} is VALID [2018-11-14 16:36:18,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:18,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {2816#true} assume !~bvsgt32(~len, 0bv32); {2816#true} is VALID [2018-11-14 16:36:18,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {2816#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2816#true} is VALID [2018-11-14 16:36:18,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:18,801 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2816#true} {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,809 INFO L256 TraceCheckUtils]: 24: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2816#true} is VALID [2018-11-14 16:36:18,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {2816#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2897#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:36:18,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {2897#(= sll_length_~len~0 (_ bv0 32))} assume true; {2897#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:36:18,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {2897#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:18,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {2921#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:36:18,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {2921#(= (_ bv2 32) |sll_length_#res|)} assume true; {2921#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:36:18,836 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2921#(= (_ bv2 32) |sll_length_#res|)} {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #100#return; {2928#(and (= (bvadd |main_#t~ret10| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:18,852 INFO L273 TraceCheckUtils]: 35: Hoare triple {2928#(and (= (bvadd |main_#t~ret10| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)))} assume ~len~1 != #t~ret10;havoc #t~ret10; {2817#false} is VALID [2018-11-14 16:36:18,852 INFO L273 TraceCheckUtils]: 36: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2018-11-14 16:36:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 16:36:18,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:19,009 INFO L273 TraceCheckUtils]: 36: Hoare triple {2817#false} assume !false; {2817#false} is VALID [2018-11-14 16:36:19,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {2938#(= |main_#t~ret10| main_~len~1)} assume ~len~1 != #t~ret10;havoc #t~ret10; {2817#false} is VALID [2018-11-14 16:36:19,011 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2921#(= (_ bv2 32) |sll_length_#res|)} {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #100#return; {2938#(= |main_#t~ret10| main_~len~1)} is VALID [2018-11-14 16:36:19,012 INFO L273 TraceCheckUtils]: 33: Hoare triple {2921#(= (_ bv2 32) |sll_length_#res|)} assume true; {2921#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:36:19,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {2921#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:36:19,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,014 INFO L273 TraceCheckUtils]: 29: Hoare triple {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2911#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,018 INFO L273 TraceCheckUtils]: 27: Hoare triple {2897#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,018 INFO L273 TraceCheckUtils]: 26: Hoare triple {2897#(= sll_length_~len~0 (_ bv0 32))} assume true; {2897#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:36:19,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {2816#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2897#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:36:19,019 INFO L256 TraceCheckUtils]: 24: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2816#true} is VALID [2018-11-14 16:36:19,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,025 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2816#true} {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:19,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {2816#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2816#true} is VALID [2018-11-14 16:36:19,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {2816#true} assume !~bvsgt32(~len, 0bv32); {2816#true} is VALID [2018-11-14 16:36:19,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:19,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {2816#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; {2816#true} is VALID [2018-11-14 16:36:19,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {2816#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2816#true} is VALID [2018-11-14 16:36:19,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {2816#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2816#true} is VALID [2018-11-14 16:36:19,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:19,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {2816#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; {2816#true} is VALID [2018-11-14 16:36:19,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {2816#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2816#true} is VALID [2018-11-14 16:36:19,027 INFO L273 TraceCheckUtils]: 11: Hoare triple {2816#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2816#true} is VALID [2018-11-14 16:36:19,028 INFO L273 TraceCheckUtils]: 10: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:19,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {2816#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2816#true} is VALID [2018-11-14 16:36:19,028 INFO L256 TraceCheckUtils]: 8: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {2816#true} is VALID [2018-11-14 16:36:19,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {2816#true} ~len~1 := 2bv32; {2836#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:19,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {2816#true} call #t~ret11 := main(); {2816#true} is VALID [2018-11-14 16:36:19,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2816#true} {2816#true} #104#return; {2816#true} is VALID [2018-11-14 16:36:19,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {2816#true} assume true; {2816#true} is VALID [2018-11-14 16:36:19,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {2816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2816#true} is VALID [2018-11-14 16:36:19,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {2816#true} call ULTIMATE.init(); {2816#true} is VALID [2018-11-14 16:36:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 16:36:19,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:19,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:36:19,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-14 16:36:19,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:19,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:36:19,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:19,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:36:19,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:36:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:36:19,108 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-11-14 16:36:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:19,881 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 16:36:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:36:19,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-14 16:36:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:36:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-14 16:36:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:36:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-14 16:36:19,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2018-11-14 16:36:19,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:19,948 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:36:19,949 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 16:36:19,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:36:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 16:36:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-14 16:36:19,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:19,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2018-11-14 16:36:19,997 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2018-11-14 16:36:19,997 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2018-11-14 16:36:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:20,001 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 16:36:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 16:36:20,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:20,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:20,002 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2018-11-14 16:36:20,002 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2018-11-14 16:36:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:20,004 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 16:36:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-14 16:36:20,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:20,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:20,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:20,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:36:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-14 16:36:20,007 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 37 [2018-11-14 16:36:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:20,007 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-14 16:36:20,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:36:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 16:36:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:36:20,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:20,008 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-14 16:36:20,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:20,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1375210204, now seen corresponding path program 4 times [2018-11-14 16:36:20,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:20,009 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:36:20,025 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:36:20,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:36:20,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:36:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:20,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:20,185 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:20,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-14 16:36:20,204 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:20,252 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:20,258 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:36:20,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,286 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:20,290 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:36:20,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-14 16:36:20,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:20,372 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:20,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 16:36:20,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-11-14 16:36:20,515 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:20,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 16:36:20,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:36:20,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 16:36:20,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:20,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:20,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-11-14 16:36:22,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3294#true} is VALID [2018-11-14 16:36:22,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {3294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3294#true} is VALID [2018-11-14 16:36:22,598 INFO L273 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2018-11-14 16:36:22,598 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #104#return; {3294#true} is VALID [2018-11-14 16:36:22,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret11 := main(); {3294#true} is VALID [2018-11-14 16:36:22,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {3294#true} ~len~1 := 2bv32; {3294#true} is VALID [2018-11-14 16:36:22,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {3294#true} assume true; {3294#true} is VALID [2018-11-14 16:36:22,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {3294#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {3294#true} is VALID [2018-11-14 16:36:22,599 INFO L256 TraceCheckUtils]: 8: Hoare triple {3294#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {3294#true} is VALID [2018-11-14 16:36:22,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {3294#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:22,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume true; {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:22,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3333#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:22,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {3333#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3333#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:22,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {3333#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ 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; {3340#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-14 16:36:22,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {3340#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} assume true; {3340#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-14 16:36:22,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {3340#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3347#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-14 16:36:22,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {3347#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3347#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-14 16:36:22,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {3347#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base 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; {3354#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:22,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {3354#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} assume true; {3354#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:22,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {3354#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {3354#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:22,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {3354#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3364#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:22,613 INFO L273 TraceCheckUtils]: 21: Hoare triple {3364#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} assume true; {3364#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:22,615 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3364#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} {3294#true} #98#return; {3371#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32)) |main_#t~ret9.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) |main_#t~ret9.offset|))} is VALID [2018-11-14 16:36:22,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {3371#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32)) |main_#t~ret9.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) |main_#t~ret9.offset|))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {3375#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-14 16:36:22,619 INFO L256 TraceCheckUtils]: 24: Hoare triple {3375#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {3379#(exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))))} is VALID [2018-11-14 16:36:22,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {3379#(exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3383#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 16:36:22,621 INFO L273 TraceCheckUtils]: 26: Hoare triple {3383#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume true; {3383#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 16:36:22,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {3383#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3390#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 16:36:22,626 INFO L273 TraceCheckUtils]: 28: Hoare triple {3390#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume true; {3390#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 16:36:22,627 INFO L273 TraceCheckUtils]: 29: Hoare triple {3390#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3397#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} is VALID [2018-11-14 16:36:22,629 INFO L273 TraceCheckUtils]: 30: Hoare triple {3397#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} assume true; {3397#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} is VALID [2018-11-14 16:36:22,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {3397#(and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-14 16:36:22,631 INFO L273 TraceCheckUtils]: 32: Hoare triple {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume true; {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-14 16:36:22,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-14 16:36:22,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} #res := ~len~0; {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-14 16:36:22,633 INFO L273 TraceCheckUtils]: 35: Hoare triple {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume true; {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-14 16:36:22,637 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3404#(or (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= v_main_~s~0.base_BEFORE_CALL_5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_5) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} {3375#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #100#return; {3295#false} is VALID [2018-11-14 16:36:22,637 INFO L273 TraceCheckUtils]: 37: Hoare triple {3295#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {3295#false} is VALID [2018-11-14 16:36:22,637 INFO L273 TraceCheckUtils]: 38: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2018-11-14 16:36:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:36:22,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:23,760 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-14 16:36:24,086 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-14 16:36:24,312 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-14 16:36:24,556 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-14 16:36:32,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-14 16:36:32,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 16:36:32,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:32,860 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 16 treesize of output 12 [2018-11-14 16:36:32,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-14 16:36:32,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:32,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:32,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:36:32,951 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 38 treesize of output 31 [2018-11-14 16:36:33,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 16:36:33,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:33,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-14 16:36:33,053 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:33,054 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:33,061 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:33,065 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 16 treesize of output 12 [2018-11-14 16:36:33,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-14 16:36:33,072 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:33,075 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:33,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-14 16:36:33,173 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 5 xjuncts. [2018-11-14 16:36:33,174 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:77, output treesize:67 [2018-11-14 16:36:35,185 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:36,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2018-11-14 16:36:36,096 INFO L273 TraceCheckUtils]: 37: Hoare triple {3295#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {3295#false} is VALID [2018-11-14 16:36:36,097 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} {3432#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))))} #100#return; {3295#false} is VALID [2018-11-14 16:36:36,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} #res := ~len~0; {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,100 INFO L273 TraceCheckUtils]: 32: Hoare triple {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,102 INFO L273 TraceCheckUtils]: 31: Hoare triple {3452#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3436#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {3452#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {3452#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {3459#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3452#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {3459#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {3459#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {3466#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3459#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {3466#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {3466#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {3294#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3466#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-14 16:36:36,110 INFO L256 TraceCheckUtils]: 24: Hoare triple {3432#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {3294#true} is VALID [2018-11-14 16:36:36,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {3476#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|))))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {3432#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))))} is VALID [2018-11-14 16:36:36,113 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3483#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} {3294#true} #98#return; {3476#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|))))} is VALID [2018-11-14 16:36:36,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {3483#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} assume true; {3483#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-14 16:36:36,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {3490#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3483#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-14 16:36:36,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {3490#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume !~bvsgt32(~len, 0bv32); {3490#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:36:36,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {3490#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume true; {3490#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:36:36,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {3500#(and (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ 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; {3490#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:36:36,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {3500#(and (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3500#(and (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 16:36:36,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {3507#(and (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_5 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_5 (store (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32) sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3500#(and (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 16:36:36,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {3507#(and (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_5 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_5 (store (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32) sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))))} assume true; {3507#(and (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_5 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_5 (store (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32) sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))))} is VALID [2018-11-14 16:36:36,133 INFO L273 TraceCheckUtils]: 13: Hoare triple {3514#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_5 (_ BitVec 32))) (or (= v_prenex_5 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~head~0.base (_ bv0 32)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= v_prenex_7 sll_create_~new_head~0.base)))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)))} 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; {3507#(and (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_5 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_5 (store (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32) sll_create_~head~0.offset)) sll_create_~head~0.base) sll_create_~head~0.offset)) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))))} is VALID [2018-11-14 16:36:36,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {3514#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_5 (_ BitVec 32))) (or (= v_prenex_5 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~head~0.base (_ bv0 32)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= v_prenex_7 sll_create_~new_head~0.base)))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3514#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_5 (_ BitVec 32))) (or (= v_prenex_5 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~head~0.base (_ bv0 32)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= v_prenex_7 sll_create_~new_head~0.base)))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:36,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3514#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_5 (_ BitVec 32))) (or (= v_prenex_5 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~head~0.base (_ bv0 32)) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_7) (_ bv0 1))) (= v_prenex_7 sll_create_~new_head~0.base)))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:36:36,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume true; {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:36,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {3294#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3326#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:36,143 INFO L256 TraceCheckUtils]: 8: Hoare triple {3294#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {3294#true} is VALID [2018-11-14 16:36:36,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {3294#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {3294#true} is VALID [2018-11-14 16:36:36,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {3294#true} assume true; {3294#true} is VALID [2018-11-14 16:36:36,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {3294#true} ~len~1 := 2bv32; {3294#true} is VALID [2018-11-14 16:36:36,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret11 := main(); {3294#true} is VALID [2018-11-14 16:36:36,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #104#return; {3294#true} is VALID [2018-11-14 16:36:36,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2018-11-14 16:36:36,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {3294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3294#true} is VALID [2018-11-14 16:36:36,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3294#true} is VALID [2018-11-14 16:36:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:36:36,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:36,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2018-11-14 16:36:36,158 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2018-11-14 16:36:36,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:36,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 16:36:36,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:36,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 16:36:36,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 16:36:36,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=574, Unknown=1, NotChecked=0, Total=650 [2018-11-14 16:36:36,347 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 26 states. [2018-11-14 16:36:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:41,343 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-14 16:36:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:36:41,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39 [2018-11-14 16:36:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:36:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2018-11-14 16:36:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:36:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2018-11-14 16:36:41,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2018-11-14 16:36:41,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:41,534 INFO L225 Difference]: With dead ends: 82 [2018-11-14 16:36:41,535 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:36:41,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=88, Invalid=667, Unknown=1, NotChecked=0, Total=756 [2018-11-14 16:36:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:36:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-11-14 16:36:41,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:41,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 67 states. [2018-11-14 16:36:41,659 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 67 states. [2018-11-14 16:36:41,659 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 67 states. [2018-11-14 16:36:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:41,663 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 16:36:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-14 16:36:41,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:41,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:41,664 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 72 states. [2018-11-14 16:36:41,664 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 72 states. [2018-11-14 16:36:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:41,667 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-14 16:36:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-14 16:36:41,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:41,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:41,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:41,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 16:36:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-11-14 16:36:41,671 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 39 [2018-11-14 16:36:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:41,671 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-11-14 16:36:41,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 16:36:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-11-14 16:36:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:36:41,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:41,672 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-14 16:36:41,672 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:41,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash 40150180, now seen corresponding path program 2 times [2018-11-14 16:36:41,673 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:41,673 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:41,691 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:36:41,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:36:41,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:36:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:41,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:41,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {3906#true} call ULTIMATE.init(); {3906#true} is VALID [2018-11-14 16:36:41,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {3906#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3906#true} is VALID [2018-11-14 16:36:41,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2018-11-14 16:36:41,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {3906#true} #104#return; {3906#true} is VALID [2018-11-14 16:36:41,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {3906#true} call #t~ret11 := main(); {3906#true} is VALID [2018-11-14 16:36:41,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {3906#true} ~len~1 := 2bv32; {3926#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:41,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {3926#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3926#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:41,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {3926#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:41,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:41,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:41,901 INFO L256 TraceCheckUtils]: 10: Hoare triple {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {3906#true} is VALID [2018-11-14 16:36:41,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {3906#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3946#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:41,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {3946#(= |sll_create_#in~len| sll_create_~len)} assume true; {3946#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:41,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {3946#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3946#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:41,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {3946#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3946#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:36:41,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {3946#(= |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; {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:41,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:41,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:41,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3959#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:36:41,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {3959#(= (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; {3972#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:36:41,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {3972#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume true; {3972#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:36:41,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {3972#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:41,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:41,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:41,934 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {3933#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} #98#return; {3907#false} is VALID [2018-11-14 16:36:41,934 INFO L273 TraceCheckUtils]: 25: Hoare triple {3907#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {3907#false} is VALID [2018-11-14 16:36:41,934 INFO L256 TraceCheckUtils]: 26: Hoare triple {3907#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {3907#false} is VALID [2018-11-14 16:36:41,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {3907#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3907#false} is VALID [2018-11-14 16:36:41,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {3907#false} assume true; {3907#false} is VALID [2018-11-14 16:36:41,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {3907#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3907#false} is VALID [2018-11-14 16:36:41,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {3907#false} assume true; {3907#false} is VALID [2018-11-14 16:36:41,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {3907#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3907#false} is VALID [2018-11-14 16:36:41,936 INFO L273 TraceCheckUtils]: 32: Hoare triple {3907#false} assume true; {3907#false} is VALID [2018-11-14 16:36:41,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {3907#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3907#false} is VALID [2018-11-14 16:36:41,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {3907#false} #res := ~len~0; {3907#false} is VALID [2018-11-14 16:36:41,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {3907#false} assume true; {3907#false} is VALID [2018-11-14 16:36:41,937 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3907#false} {3907#false} #100#return; {3907#false} is VALID [2018-11-14 16:36:41,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {3907#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {3907#false} is VALID [2018-11-14 16:36:41,937 INFO L273 TraceCheckUtils]: 38: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2018-11-14 16:36:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:36:41,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:42,405 INFO L273 TraceCheckUtils]: 38: Hoare triple {3907#false} assume !false; {3907#false} is VALID [2018-11-14 16:36:42,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {3907#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {3907#false} is VALID [2018-11-14 16:36:42,406 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3906#true} {3907#false} #100#return; {3907#false} is VALID [2018-11-14 16:36:42,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {3906#true} assume true; {3906#true} is VALID [2018-11-14 16:36:42,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {3906#true} #res := ~len~0; {3906#true} is VALID [2018-11-14 16:36:42,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {3906#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3906#true} is VALID [2018-11-14 16:36:42,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {3906#true} assume true; {3906#true} is VALID [2018-11-14 16:36:42,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {3906#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3906#true} is VALID [2018-11-14 16:36:42,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {3906#true} assume true; {3906#true} is VALID [2018-11-14 16:36:42,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {3906#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3906#true} is VALID [2018-11-14 16:36:42,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {3906#true} assume true; {3906#true} is VALID [2018-11-14 16:36:42,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {3906#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3906#true} is VALID [2018-11-14 16:36:42,408 INFO L256 TraceCheckUtils]: 26: Hoare triple {3907#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {3906#true} is VALID [2018-11-14 16:36:42,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {3907#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {3907#false} is VALID [2018-11-14 16:36:42,409 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {3907#false} is VALID [2018-11-14 16:36:42,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:42,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:42,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {4086#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {3979#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:36:42,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {4086#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {4086#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:36:42,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {4093#(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; {4086#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:36:42,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {4093#(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); {4093#(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:36:42,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {4093#(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(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4093#(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:36:42,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {4093#(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:36:42,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {4106#(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; {4093#(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:36:42,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {4106#(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); {4106#(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:36:42,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {4106#(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(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4106#(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:36:42,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {4106#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {4106#(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:36:42,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {3906#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4106#(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:36:42,426 INFO L256 TraceCheckUtils]: 10: Hoare triple {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {3906#true} is VALID [2018-11-14 16:36:42,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:42,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:42,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {4128#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4073#(bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:42,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {4128#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {4128#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:42,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {3906#true} ~len~1 := 2bv32; {4128#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:36:42,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {3906#true} call #t~ret11 := main(); {3906#true} is VALID [2018-11-14 16:36:42,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3906#true} {3906#true} #104#return; {3906#true} is VALID [2018-11-14 16:36:42,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {3906#true} assume true; {3906#true} is VALID [2018-11-14 16:36:42,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {3906#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3906#true} is VALID [2018-11-14 16:36:42,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {3906#true} call ULTIMATE.init(); {3906#true} is VALID [2018-11-14 16:36:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:36:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-14 16:36:42,438 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-14 16:36:42,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:42,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:36:42,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:42,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:36:42,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:36:42,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:36:42,558 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 13 states. [2018-11-14 16:36:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:44,968 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-11-14 16:36:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:36:44,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-11-14 16:36:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:36:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:36:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-14 16:36:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:36:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-14 16:36:44,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 114 transitions. [2018-11-14 16:36:45,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:45,252 INFO L225 Difference]: With dead ends: 141 [2018-11-14 16:36:45,252 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 16:36:45,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:36:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 16:36:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2018-11-14 16:36:45,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:36:45,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 66 states. [2018-11-14 16:36:45,481 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 66 states. [2018-11-14 16:36:45,481 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 66 states. [2018-11-14 16:36:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:45,484 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-14 16:36:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2018-11-14 16:36:45,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:45,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:45,484 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 90 states. [2018-11-14 16:36:45,485 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 90 states. [2018-11-14 16:36:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:36:45,488 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-11-14 16:36:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2018-11-14 16:36:45,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:36:45,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:36:45,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:36:45,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:36:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 16:36:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-11-14 16:36:45,491 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 39 [2018-11-14 16:36:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:36:45,491 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-11-14 16:36:45,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:36:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-11-14 16:36:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 16:36:45,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:36:45,492 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:36:45,493 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:36:45,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:36:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1733466076, now seen corresponding path program 3 times [2018-11-14 16:36:45,493 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:36:45,493 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:45,511 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:36:45,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:36:45,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:36:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:36:45,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:36:45,756 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:45,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-11-14 16:36:45,771 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:45,803 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:45,807 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:45,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,825 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:36:45,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-14 16:36:45,836 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:45,874 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:45,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:36:45,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 16:36:45,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-11-14 16:36:45,892 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:45,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-14 16:36:45,973 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:45,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:45,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:46,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:36:46,028 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:36:46,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:46,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:46,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:46,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:28 [2018-11-14 16:36:46,089 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:46,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {4632#true} call ULTIMATE.init(); {4632#true} is VALID [2018-11-14 16:36:46,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {4632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4632#true} is VALID [2018-11-14 16:36:46,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:46,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4632#true} {4632#true} #104#return; {4632#true} is VALID [2018-11-14 16:36:46,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {4632#true} call #t~ret11 := main(); {4632#true} is VALID [2018-11-14 16:36:46,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {4632#true} ~len~1 := 2bv32; {4632#true} is VALID [2018-11-14 16:36:46,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:46,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {4632#true} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4632#true} is VALID [2018-11-14 16:36:46,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:46,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {4632#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {4632#true} is VALID [2018-11-14 16:36:46,758 INFO L256 TraceCheckUtils]: 10: Hoare triple {4632#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {4632#true} is VALID [2018-11-14 16:36:46,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {4632#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4632#true} is VALID [2018-11-14 16:36:46,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:46,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {4632#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4676#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:46,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {4676#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4676#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:46,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {4676#(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; {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:46,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:46,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4690#(and (not (= sll_create_~head~0.base (_ bv0 32))) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 16:36:46,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {4690#(and (not (= sll_create_~head~0.base (_ bv0 32))) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4690#(and (not (= sll_create_~head~0.base (_ bv0 32))) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-14 16:36:46,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {4690#(and (not (= sll_create_~head~0.base (_ bv0 32))) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ 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; {4697#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:36:46,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {4697#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume true; {4697#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:36:46,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {4697#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4704#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-14 16:36:46,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {4704#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4704#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-14 16:36:46,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {4704#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base 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; {4711#(and (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32))))))} is VALID [2018-11-14 16:36:46,769 INFO L273 TraceCheckUtils]: 24: Hoare triple {4711#(and (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32))))))} assume true; {4711#(and (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32))))))} is VALID [2018-11-14 16:36:46,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {4711#(and (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32))))))} assume !~bvsgt32(~len, 0bv32); {4711#(and (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32))))))} is VALID [2018-11-14 16:36:46,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {4711#(and (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32))))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4721#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32))))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:36:46,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {4721#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32))))) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {4721#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32))))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:36:46,775 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4721#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32))))) (= |sll_create_#res.offset| (_ bv0 32)))} {4632#true} #98#return; {4728#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32)) |main_#t~ret9.base|)) (= (_ bv0 32) |main_#t~ret9.offset|))} is VALID [2018-11-14 16:36:46,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {4728#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32)) |main_#t~ret9.base|)) (= (_ bv0 32) |main_#t~ret9.offset|))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {4732#(and (= main_~s~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-14 16:36:46,778 INFO L256 TraceCheckUtils]: 30: Hoare triple {4732#(and (= main_~s~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {4736#(exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8))))} is VALID [2018-11-14 16:36:46,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {4736#(exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4740#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 16:36:46,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {4740#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume true; {4740#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-14 16:36:46,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {4740#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4747#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 16:36:46,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {4747#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume true; {4747#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-14 16:36:46,785 INFO L273 TraceCheckUtils]: 35: Hoare triple {4747#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4754#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} is VALID [2018-11-14 16:36:46,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {4754#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} assume true; {4754#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} is VALID [2018-11-14 16:36:46,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {4754#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4761#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:46,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {4761#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} #res := ~len~0; {4761#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:46,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {4761#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume true; {4761#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:46,791 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4761#(and (exists ((v_main_~s~0.base_BEFORE_CALL_8 (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_8) (_ bv0 32)) v_main_~s~0.base_BEFORE_CALL_8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} {4732#(and (= main_~s~0.offset (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32))))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #100#return; {4633#false} is VALID [2018-11-14 16:36:46,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {4633#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {4633#false} is VALID [2018-11-14 16:36:46,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2018-11-14 16:36:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:36:46,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:36:47,660 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-14 16:36:47,818 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 16:36:47,999 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 16:36:48,170 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 16:36:54,814 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 32 treesize of output 26 [2018-11-14 16:36:54,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-14 16:36:54,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:54,909 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 20 treesize of output 16 [2018-11-14 16:36:54,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-14 16:36:54,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:54,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:54,931 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 21 treesize of output 19 [2018-11-14 16:36:54,936 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:54,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:54,967 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:54,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-14 16:36:54,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-14 16:36:54,979 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:36:54,986 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:36:55,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:36:55,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:36:55,055 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:39, output treesize:37 [2018-11-14 16:36:55,066 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:36:55,327 INFO L273 TraceCheckUtils]: 42: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2018-11-14 16:36:55,327 INFO L273 TraceCheckUtils]: 41: Hoare triple {4633#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {4633#false} is VALID [2018-11-14 16:36:55,329 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {4787#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))} {4783#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))))} #100#return; {4633#false} is VALID [2018-11-14 16:36:55,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {4787#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))} assume true; {4787#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))} is VALID [2018-11-14 16:36:55,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {4787#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))} #res := ~len~0; {4787#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))} is VALID [2018-11-14 16:36:55,334 INFO L273 TraceCheckUtils]: 37: Hoare triple {4797#(or (not (= (_ bv0 32) sll_length_~head.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4787#(= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))} is VALID [2018-11-14 16:36:55,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {4797#(or (not (= (_ bv0 32) sll_length_~head.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume true; {4797#(or (not (= (_ bv0 32) sll_length_~head.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {4804#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4797#(or (not (= (_ bv0 32) sll_length_~head.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {4804#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume true; {4804#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {4811#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4804#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {4811#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} assume true; {4811#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {4632#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4811#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,338 INFO L256 TraceCheckUtils]: 30: Hoare triple {4783#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {4632#true} is VALID [2018-11-14 16:36:55,339 INFO L273 TraceCheckUtils]: 29: Hoare triple {4821#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|))))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {4783#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))))} is VALID [2018-11-14 16:36:55,340 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} {4632#true} #98#return; {4821#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|))))} is VALID [2018-11-14 16:36:55,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {4828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} assume true; {4828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-14 16:36:55,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {4835#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4828#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-14 16:36:55,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {4835#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {4835#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {4835#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)))} assume true; {4835#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {4845#(not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ 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; {4835#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {4845#(not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4845#(not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,350 INFO L273 TraceCheckUtils]: 21: Hoare triple {4852#(forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4845#(not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset) (_ bv0 32)))} is VALID [2018-11-14 16:36:55,350 INFO L273 TraceCheckUtils]: 20: Hoare triple {4852#(forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))))} assume true; {4852#(forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))))} is VALID [2018-11-14 16:36:55,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {4859#(and (or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1)))) (or (not (= sll_create_~head~0.base (_ bv0 32))) (forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))))))} 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; {4852#(forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_44) (_ bv0 32) sll_create_~head~0.base)) sll_create_~head~0.base) sll_create_~head~0.offset)))))} is VALID [2018-11-14 16:36:55,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {4859#(and (or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1)))) (or (not (= sll_create_~head~0.base (_ bv0 32))) (forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4859#(and (or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1)))) (or (not (= sll_create_~head~0.base (_ bv0 32))) (forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))))))} is VALID [2018-11-14 16:36:55,357 INFO L273 TraceCheckUtils]: 17: Hoare triple {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4859#(and (or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1)))) (or (not (= sll_create_~head~0.base (_ bv0 32))) (forall ((v_sll_create_~new_head~0.base_44 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_sll_create_~new_head~0.base_44))))))} is VALID [2018-11-14 16:36:55,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} assume true; {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:55,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {4676#(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; {4683#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 16:36:55,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {4676#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4676#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:55,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {4632#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4676#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-14 16:36:55,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:55,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {4632#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4632#true} is VALID [2018-11-14 16:36:55,359 INFO L256 TraceCheckUtils]: 10: Hoare triple {4632#true} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {4632#true} is VALID [2018-11-14 16:36:55,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {4632#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {4632#true} is VALID [2018-11-14 16:36:55,359 INFO L273 TraceCheckUtils]: 8: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:55,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {4632#true} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4632#true} is VALID [2018-11-14 16:36:55,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:55,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {4632#true} ~len~1 := 2bv32; {4632#true} is VALID [2018-11-14 16:36:55,360 INFO L256 TraceCheckUtils]: 4: Hoare triple {4632#true} call #t~ret11 := main(); {4632#true} is VALID [2018-11-14 16:36:55,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4632#true} {4632#true} #104#return; {4632#true} is VALID [2018-11-14 16:36:55,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {4632#true} assume true; {4632#true} is VALID [2018-11-14 16:36:55,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {4632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4632#true} is VALID [2018-11-14 16:36:55,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {4632#true} call ULTIMATE.init(); {4632#true} is VALID [2018-11-14 16:36:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:36:55,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:36:55,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 27 [2018-11-14 16:36:55,376 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-14 16:36:55,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:36:55,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 16:36:55,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:36:55,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 16:36:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 16:36:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=623, Unknown=2, NotChecked=0, Total=702 [2018-11-14 16:36:55,500 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 27 states. [2018-11-14 16:37:06,641 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2018-11-14 16:37:26,122 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-11-14 16:37:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:28,456 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-11-14 16:37:28,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:37:28,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-14 16:37:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:37:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:37:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-14 16:37:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:37:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-14 16:37:28,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 72 transitions. [2018-11-14 16:37:28,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:28,632 INFO L225 Difference]: With dead ends: 79 [2018-11-14 16:37:28,632 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 16:37:28,634 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=173, Invalid=1013, Unknown=4, NotChecked=0, Total=1190 [2018-11-14 16:37:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 16:37:28,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-11-14 16:37:28,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:37:28,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 68 states. [2018-11-14 16:37:28,887 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 68 states. [2018-11-14 16:37:28,888 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 68 states. [2018-11-14 16:37:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:28,890 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-14 16:37:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-11-14 16:37:28,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:28,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:28,891 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 73 states. [2018-11-14 16:37:28,891 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 73 states. [2018-11-14 16:37:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:28,893 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-14 16:37:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-11-14 16:37:28,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:28,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:28,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:37:28,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:37:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 16:37:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-14 16:37:28,897 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 43 [2018-11-14 16:37:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:37:28,897 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-14 16:37:28,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 16:37:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-11-14 16:37:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:37:28,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:37:28,898 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-11-14 16:37:28,898 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:37:28,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:37:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1946462090, now seen corresponding path program 4 times [2018-11-14 16:37:28,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:37:28,899 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:37:28,930 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:37:28,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:37:28,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:37:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:28,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:37:29,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {5286#true} call ULTIMATE.init(); {5286#true} is VALID [2018-11-14 16:37:29,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {5286#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5286#true} is VALID [2018-11-14 16:37:29,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5286#true} {5286#true} #104#return; {5286#true} is VALID [2018-11-14 16:37:29,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {5286#true} call #t~ret11 := main(); {5286#true} is VALID [2018-11-14 16:37:29,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {5286#true} ~len~1 := 2bv32; {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,166 INFO L256 TraceCheckUtils]: 10: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {5286#true} is VALID [2018-11-14 16:37:29,166 INFO L273 TraceCheckUtils]: 11: Hoare triple {5286#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5286#true} is VALID [2018-11-14 16:37:29,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {5286#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5286#true} is VALID [2018-11-14 16:37:29,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {5286#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {5286#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; {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 16: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {5286#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {5286#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {5286#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; {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {5286#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 22: Hoare triple {5286#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {5286#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; {5286#true} is VALID [2018-11-14 16:37:29,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {5286#true} assume !~bvsgt32(~len, 0bv32); {5286#true} is VALID [2018-11-14 16:37:29,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {5286#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5286#true} is VALID [2018-11-14 16:37:29,168 INFO L273 TraceCheckUtils]: 27: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,169 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {5286#true} {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} #98#return; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,170 INFO L273 TraceCheckUtils]: 29: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,170 INFO L256 TraceCheckUtils]: 30: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,170 INFO L273 TraceCheckUtils]: 31: Hoare triple {5286#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5386#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:37:29,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {5386#(= sll_length_~len~0 (_ bv0 32))} assume true; {5386#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:37:29,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {5386#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,174 INFO L273 TraceCheckUtils]: 37: Hoare triple {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5407#(= (_ bv3 32) sll_length_~len~0)} is VALID [2018-11-14 16:37:29,175 INFO L273 TraceCheckUtils]: 38: Hoare triple {5407#(= (_ bv3 32) sll_length_~len~0)} assume true; {5407#(= (_ bv3 32) sll_length_~len~0)} is VALID [2018-11-14 16:37:29,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {5407#(= (_ bv3 32) sll_length_~len~0)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5407#(= (_ bv3 32) sll_length_~len~0)} is VALID [2018-11-14 16:37:29,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {5407#(= (_ bv3 32) sll_length_~len~0)} #res := ~len~0; {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,177 INFO L273 TraceCheckUtils]: 41: Hoare triple {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} assume true; {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,178 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} #100#return; {5424#(and (= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~ret10|))} is VALID [2018-11-14 16:37:29,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {5424#(and (= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv3 32) |main_#t~ret10|))} assume ~len~1 != #t~ret10;havoc #t~ret10; {5287#false} is VALID [2018-11-14 16:37:29,179 INFO L273 TraceCheckUtils]: 44: Hoare triple {5287#false} assume !false; {5287#false} is VALID [2018-11-14 16:37:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:37:29,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:37:29,307 INFO L273 TraceCheckUtils]: 44: Hoare triple {5287#false} assume !false; {5287#false} is VALID [2018-11-14 16:37:29,307 INFO L273 TraceCheckUtils]: 43: Hoare triple {5434#(= |main_#t~ret10| main_~len~1)} assume ~len~1 != #t~ret10;havoc #t~ret10; {5287#false} is VALID [2018-11-14 16:37:29,309 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} #100#return; {5434#(= |main_#t~ret10| main_~len~1)} is VALID [2018-11-14 16:37:29,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} assume true; {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {5407#(= (_ bv3 32) sll_length_~len~0)} #res := ~len~0; {5417#(= (bvadd |sll_length_#res| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {5407#(= (_ bv3 32) sll_length_~len~0)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5407#(= (_ bv3 32) sll_length_~len~0)} is VALID [2018-11-14 16:37:29,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {5407#(= (_ bv3 32) sll_length_~len~0)} assume true; {5407#(= (_ bv3 32) sll_length_~len~0)} is VALID [2018-11-14 16:37:29,312 INFO L273 TraceCheckUtils]: 37: Hoare triple {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5407#(= (_ bv3 32) sll_length_~len~0)} is VALID [2018-11-14 16:37:29,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5400#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {5386#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5393#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {5386#(= sll_length_~len~0 (_ bv0 32))} assume true; {5386#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:37:29,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {5286#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5386#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:37:29,317 INFO L256 TraceCheckUtils]: 30: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,317 INFO L273 TraceCheckUtils]: 29: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,318 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {5286#true} {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} #98#return; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {5286#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5286#true} is VALID [2018-11-14 16:37:29,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {5286#true} assume !~bvsgt32(~len, 0bv32); {5286#true} is VALID [2018-11-14 16:37:29,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {5286#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; {5286#true} is VALID [2018-11-14 16:37:29,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {5286#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {5286#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5286#true} is VALID [2018-11-14 16:37:29,320 INFO L273 TraceCheckUtils]: 20: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {5286#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; {5286#true} is VALID [2018-11-14 16:37:29,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {5286#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {5286#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5286#true} is VALID [2018-11-14 16:37:29,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {5286#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; {5286#true} is VALID [2018-11-14 16:37:29,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {5286#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5286#true} is VALID [2018-11-14 16:37:29,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {5286#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5286#true} is VALID [2018-11-14 16:37:29,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {5286#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5286#true} is VALID [2018-11-14 16:37:29,322 INFO L256 TraceCheckUtils]: 10: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {5286#true} is VALID [2018-11-14 16:37:29,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5313#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {5286#true} ~len~1 := 2bv32; {5306#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:29,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {5286#true} call #t~ret11 := main(); {5286#true} is VALID [2018-11-14 16:37:29,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5286#true} {5286#true} #104#return; {5286#true} is VALID [2018-11-14 16:37:29,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {5286#true} assume true; {5286#true} is VALID [2018-11-14 16:37:29,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {5286#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5286#true} is VALID [2018-11-14 16:37:29,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {5286#true} call ULTIMATE.init(); {5286#true} is VALID [2018-11-14 16:37:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:37:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:37:29,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:37:29,330 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-11-14 16:37:29,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:37:29,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:37:29,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:29,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:37:29,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:37:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:37:29,373 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 11 states. [2018-11-14 16:37:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:30,399 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-14 16:37:30,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:37:30,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-11-14 16:37:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:37:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:37:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2018-11-14 16:37:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:37:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2018-11-14 16:37:30,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2018-11-14 16:37:31,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:31,129 INFO L225 Difference]: With dead ends: 82 [2018-11-14 16:37:31,129 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 16:37:31,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:37:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 16:37:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-11-14 16:37:31,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:37:31,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 76 states. [2018-11-14 16:37:31,423 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 76 states. [2018-11-14 16:37:31,423 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 76 states. [2018-11-14 16:37:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:31,426 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-14 16:37:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-14 16:37:31,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:31,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:31,428 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 79 states. [2018-11-14 16:37:31,428 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 79 states. [2018-11-14 16:37:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:37:31,430 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-14 16:37:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-11-14 16:37:31,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:37:31,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:37:31,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:37:31,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:37:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 16:37:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-11-14 16:37:31,434 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 45 [2018-11-14 16:37:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:37:31,434 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-11-14 16:37:31,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:37:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-11-14 16:37:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:37:31,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:37:31,435 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 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] [2018-11-14 16:37:31,436 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:37:31,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:37:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1815413618, now seen corresponding path program 5 times [2018-11-14 16:37:31,436 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:37:31,436 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:37:31,461 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-14 16:37:31,592 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-14 16:37:31,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:37:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:37:31,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:37:31,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5948#true} is VALID [2018-11-14 16:37:31,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {5948#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5948#true} is VALID [2018-11-14 16:37:31,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2018-11-14 16:37:31,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #104#return; {5948#true} is VALID [2018-11-14 16:37:31,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret11 := main(); {5948#true} is VALID [2018-11-14 16:37:31,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {5948#true} ~len~1 := 2bv32; {5968#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {5968#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {5968#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {5968#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5975#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {5975#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5975#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {5975#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5982#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {5982#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {5982#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {5982#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5989#(= (bvadd main_~len~1 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {5989#(= (bvadd main_~len~1 (_ bv4294967291 32)) (_ bv0 32))} assume true; {5989#(= (bvadd main_~len~1 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:37:31,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {5989#(= (bvadd main_~len~1 (_ bv4294967291 32)) (_ bv0 32))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5996#(= (_ bv6 32) main_~len~1)} is VALID [2018-11-14 16:37:31,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {5996#(= (_ bv6 32) main_~len~1)} assume true; {5996#(= (_ bv6 32) main_~len~1)} is VALID [2018-11-14 16:37:31,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {5996#(= (_ bv6 32) main_~len~1)} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {5996#(= (_ bv6 32) main_~len~1)} is VALID [2018-11-14 16:37:31,968 INFO L256 TraceCheckUtils]: 16: Hoare triple {5996#(= (_ bv6 32) main_~len~1)} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {5948#true} is VALID [2018-11-14 16:37:31,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {5948#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6009#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:37:31,969 INFO L273 TraceCheckUtils]: 18: Hoare triple {6009#(= |sll_create_#in~len| sll_create_~len)} assume true; {6009#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:37:31,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {6009#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6016#(and (= |sll_create_#in~len| sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:37:31,971 INFO L273 TraceCheckUtils]: 20: Hoare triple {6016#(and (= |sll_create_#in~len| sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6016#(and (= |sll_create_#in~len| sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 16:37:31,972 INFO L273 TraceCheckUtils]: 21: Hoare triple {6016#(and (= |sll_create_#in~len| sll_create_~len) (bvsgt sll_create_~len (_ 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; {6023#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:37:31,972 INFO L273 TraceCheckUtils]: 22: Hoare triple {6023#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {6023#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:37:31,973 INFO L273 TraceCheckUtils]: 23: Hoare triple {6023#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6030#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:37:31,974 INFO L273 TraceCheckUtils]: 24: Hoare triple {6030#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6030#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 16:37:32,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {6030#(and (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt sll_create_~len (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ 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; {6037#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)) (= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len))} is VALID [2018-11-14 16:37:32,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {6037#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)) (= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len))} assume true; {6037#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)) (= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len))} is VALID [2018-11-14 16:37:32,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {6037#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (bvsgt |sll_create_#in~len| (_ bv0 32)) (= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len))} assume !~bvsgt32(~len, 0bv32); {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:32,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:32,012 INFO L273 TraceCheckUtils]: 29: Hoare triple {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:32,013 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} {5996#(= (_ bv6 32) main_~len~1)} #98#return; {5949#false} is VALID [2018-11-14 16:37:32,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {5949#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {5949#false} is VALID [2018-11-14 16:37:32,013 INFO L256 TraceCheckUtils]: 32: Hoare triple {5949#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {5949#false} is VALID [2018-11-14 16:37:32,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {5949#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5949#false} is VALID [2018-11-14 16:37:32,013 INFO L273 TraceCheckUtils]: 34: Hoare triple {5949#false} assume true; {5949#false} is VALID [2018-11-14 16:37:32,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {5949#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5949#false} is VALID [2018-11-14 16:37:32,014 INFO L273 TraceCheckUtils]: 36: Hoare triple {5949#false} assume true; {5949#false} is VALID [2018-11-14 16:37:32,014 INFO L273 TraceCheckUtils]: 37: Hoare triple {5949#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5949#false} is VALID [2018-11-14 16:37:32,014 INFO L273 TraceCheckUtils]: 38: Hoare triple {5949#false} assume true; {5949#false} is VALID [2018-11-14 16:37:32,014 INFO L273 TraceCheckUtils]: 39: Hoare triple {5949#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5949#false} is VALID [2018-11-14 16:37:32,014 INFO L273 TraceCheckUtils]: 40: Hoare triple {5949#false} #res := ~len~0; {5949#false} is VALID [2018-11-14 16:37:32,015 INFO L273 TraceCheckUtils]: 41: Hoare triple {5949#false} assume true; {5949#false} is VALID [2018-11-14 16:37:32,015 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5949#false} {5949#false} #100#return; {5949#false} is VALID [2018-11-14 16:37:32,015 INFO L273 TraceCheckUtils]: 43: Hoare triple {5949#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {5949#false} is VALID [2018-11-14 16:37:32,015 INFO L273 TraceCheckUtils]: 44: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2018-11-14 16:37:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:37:32,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:37:33,273 INFO L273 TraceCheckUtils]: 44: Hoare triple {5949#false} assume !false; {5949#false} is VALID [2018-11-14 16:37:33,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {5949#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {5949#false} is VALID [2018-11-14 16:37:33,274 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5948#true} {5949#false} #100#return; {5949#false} is VALID [2018-11-14 16:37:33,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {5948#true} assume true; {5948#true} is VALID [2018-11-14 16:37:33,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {5948#true} #res := ~len~0; {5948#true} is VALID [2018-11-14 16:37:33,275 INFO L273 TraceCheckUtils]: 39: Hoare triple {5948#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5948#true} is VALID [2018-11-14 16:37:33,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {5948#true} assume true; {5948#true} is VALID [2018-11-14 16:37:33,275 INFO L273 TraceCheckUtils]: 37: Hoare triple {5948#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5948#true} is VALID [2018-11-14 16:37:33,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {5948#true} assume true; {5948#true} is VALID [2018-11-14 16:37:33,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {5948#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5948#true} is VALID [2018-11-14 16:37:33,276 INFO L273 TraceCheckUtils]: 34: Hoare triple {5948#true} assume true; {5948#true} is VALID [2018-11-14 16:37:33,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {5948#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5948#true} is VALID [2018-11-14 16:37:33,276 INFO L256 TraceCheckUtils]: 32: Hoare triple {5949#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {5948#true} is VALID [2018-11-14 16:37:33,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {5949#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {5949#false} is VALID [2018-11-14 16:37:33,278 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} #98#return; {5949#false} is VALID [2018-11-14 16:37:33,279 INFO L273 TraceCheckUtils]: 29: Hoare triple {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {6151#(or (bvsgt sll_create_~len (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} assume !~bvsgt32(~len, 0bv32); {6044#(and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,281 INFO L273 TraceCheckUtils]: 26: Hoare triple {6151#(or (bvsgt sll_create_~len (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} assume true; {6151#(or (bvsgt sll_create_~len (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:37:33,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {6158#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~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; {6151#(or (bvsgt sll_create_~len (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:37:33,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {6158#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~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); {6158#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:37:33,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {6165#(or (not (bvsgt sll_create_~len (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~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(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6158#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:37:33,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {6165#(or (not (bvsgt sll_create_~len (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} assume true; {6165#(or (not (bvsgt sll_create_~len (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:37:33,295 INFO L273 TraceCheckUtils]: 21: Hoare triple {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (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; {6165#(or (not (bvsgt sll_create_~len (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:37:33,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} assume true; {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {5948#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6172#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (and (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))) (not (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,297 INFO L256 TraceCheckUtils]: 16: Hoare triple {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} call #t~ret9.base, #t~ret9.offset := sll_create(~len~1); {5948#true} is VALID [2018-11-14 16:37:33,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} assume true; {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {6194#(or (not (bvsgt main_~len~1 (_ bv0 32))) (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {6138#(or (bvsgt (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {6194#(or (not (bvsgt main_~len~1 (_ bv0 32))) (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6194#(or (not (bvsgt main_~len~1 (_ bv0 32))) (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:37:33,306 INFO L273 TraceCheckUtils]: 11: Hoare triple {6201#(or (bvsgt main_~len~1 (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {6194#(or (not (bvsgt main_~len~1 (_ bv0 32))) (bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:37:33,306 INFO L273 TraceCheckUtils]: 10: Hoare triple {6201#(or (bvsgt main_~len~1 (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))))} assume true; {6201#(or (bvsgt main_~len~1 (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {6208#(or (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {6201#(or (bvsgt main_~len~1 (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {6208#(or (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))))} assume true; {6208#(or (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {6215#(or (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv3 32)) (_ bv0 32))))} assume !!(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7;#t~post8 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {6208#(or (bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {6215#(or (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv3 32)) (_ bv0 32))))} assume true; {6215#(or (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv3 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {5948#true} ~len~1 := 2bv32; {6215#(or (bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32)) (not (bvsgt (bvadd main_~len~1 (_ bv3 32)) (_ bv0 32))))} is VALID [2018-11-14 16:37:33,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {5948#true} call #t~ret11 := main(); {5948#true} is VALID [2018-11-14 16:37:33,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5948#true} {5948#true} #104#return; {5948#true} is VALID [2018-11-14 16:37:33,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {5948#true} assume true; {5948#true} is VALID [2018-11-14 16:37:33,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {5948#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5948#true} is VALID [2018-11-14 16:37:33,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {5948#true} call ULTIMATE.init(); {5948#true} is VALID [2018-11-14 16:37:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:37:33,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:37:33,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-11-14 16:37:33,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-11-14 16:37:33,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:37:33,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 16:37:33,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:37:33,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 16:37:33,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 16:37:33,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:37:33,492 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 22 states.