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_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:35:21,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:35:21,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:35:21,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:35:21,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:35:21,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:35:21,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:35:21,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:35:21,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:35:21,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:35:21,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:35:21,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:35:21,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:35:21,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:35:21,083 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:35:21,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:35:21,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:35:21,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:35:21,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:35:21,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:35:21,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:35:21,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:35:21,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:35:21,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:35:21,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:35:21,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:35:21,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:35:21,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:35:21,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:35:21,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:35:21,099 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:35:21,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:35:21,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:35:21,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:35:21,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:35:21,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:35:21,102 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:21,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:35:21,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:35:21,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:35:21,119 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:35:21,119 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:35:21,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:35:21,120 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:35:21,120 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:35:21,120 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:35:21,121 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:35:21,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:35:21,121 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:35:21,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:35:21,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:35:21,121 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:35:21,122 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:35:21,122 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:35:21,122 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:35:21,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:35:21,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:35:21,123 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:35:21,123 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:35:21,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:35:21,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:35:21,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:35:21,124 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:35:21,124 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:35:21,124 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:35:21,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:35:21,124 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:35:21,125 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:35:21,125 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:35:21,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:35:21,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:35:21,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:35:21,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:35:21,188 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:35:21,189 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_false-unreach-call_false-valid-memcleanup.i [2018-11-14 16:35:21,247 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d784e061a/4f65a633fc62440f9c5dc18edca9286c/FLAG50c867697 [2018-11-14 16:35:21,786 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:35:21,787 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-14 16:35:21,808 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d784e061a/4f65a633fc62440f9c5dc18edca9286c/FLAG50c867697 [2018-11-14 16:35:21,831 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d784e061a/4f65a633fc62440f9c5dc18edca9286c [2018-11-14 16:35:21,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:35:21,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:35:21,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:21,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:35:21,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:35:21,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:21" (1/1) ... [2018-11-14 16:35:21,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30557c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:21, skipping insertion in model container [2018-11-14 16:35:21,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:21" (1/1) ... [2018-11-14 16:35:21,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:35:21,936 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:35:22,384 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:22,399 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:35:22,487 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:22,644 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:35:22,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:22 WrapperNode [2018-11-14 16:35:22,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:22,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:35:22,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:35:22,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:35:22,660 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:22" (1/1) ... [2018-11-14 16:35:22,661 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:22" (1/1) ... [2018-11-14 16:35:22,682 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:22" (1/1) ... [2018-11-14 16:35:22,682 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:22" (1/1) ... [2018-11-14 16:35:22,721 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:22" (1/1) ... [2018-11-14 16:35:22,738 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:22" (1/1) ... [2018-11-14 16:35:22,747 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:22" (1/1) ... [2018-11-14 16:35:22,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:35:22,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:35:22,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:35:22,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:35:22,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:22" (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:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:35:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:35:22,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:35:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:35:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:35:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 16:35:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-14 16:35:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-14 16:35:22,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:35:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:35:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:35:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:35:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:35:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:35:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:35:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:35:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:35:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:35:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:35:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:35:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:35:22,831 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:35:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:35:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:35:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:35:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:35:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:35:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:35:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:35:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:35:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:35:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:35:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:35:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:35:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:35:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:35:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:35:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:35:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:35:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:35:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:35:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:35:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:35:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:35:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:35:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:35:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:35:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:35:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:35:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:35:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:35:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:35:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:35:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:35:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:35:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:35:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:35:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:35:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:35:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:35:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:35:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:35:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:35:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:35:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:35:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:35:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:35:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:35:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:35:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:35:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:35:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:35:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:35:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 16:35:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:35:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:35:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-14 16:35:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:35:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-14 16:35:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:35:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:35:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:35:22,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:35:23,804 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:35:23,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:23 BoogieIcfgContainer [2018-11-14 16:35:23,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:35:23,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:35:23,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:35:23,809 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:35:23,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:35:21" (1/3) ... [2018-11-14 16:35:23,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ebfbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:23, skipping insertion in model container [2018-11-14 16:35:23,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:22" (2/3) ... [2018-11-14 16:35:23,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ebfbef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:23, skipping insertion in model container [2018-11-14 16:35:23,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:23" (3/3) ... [2018-11-14 16:35:23,813 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-14 16:35:23,823 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:35:23,834 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:35:23,852 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:35:23,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:35:23,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:35:23,886 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:35:23,886 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:35:23,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:35:23,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:35:23,887 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:35:23,887 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:35:23,887 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:35:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 16:35:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:35:23,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:23,918 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:23,921 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:23,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:23,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1413814521, now seen corresponding path program 1 times [2018-11-14 16:35:23,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:23,932 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:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:24,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:24,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 16:35:24,164 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:24,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 16:35:24,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #104#return; {45#true} is VALID [2018-11-14 16:35:24,166 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret11 := main(); {45#true} is VALID [2018-11-14 16:35:24,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} ~len~1 := 2bv32; {45#true} is VALID [2018-11-14 16:35:24,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 16:35:24,180 INFO L256 TraceCheckUtils]: 7: Hoare triple {46#false} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {46#false} is VALID [2018-11-14 16:35:24,180 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:24,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:35:24,181 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:24,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 16:35:24,182 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {46#false} {46#false} #98#return; {46#false} is VALID [2018-11-14 16:35:24,182 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:24,183 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:24,183 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:24,183 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 16:35:24,184 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} #res := ~len~0; {46#false} is VALID [2018-11-14 16:35:24,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 16:35:24,184 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {46#false} {46#false} #100#return; {46#false} is VALID [2018-11-14 16:35:24,185 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:24,185 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 16:35:24,191 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:24,191 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 (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:35:24,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:24,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:35:24,213 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:35:24,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:24,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:35:24,320 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:24,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:35:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:35:24,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:35:24,334 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 16:35:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:25,122 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-11-14 16:35:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:35:25,122 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:35:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2018-11-14 16:35:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2018-11-14 16:35:25,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 93 transitions. [2018-11-14 16:35:25,578 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:25,591 INFO L225 Difference]: With dead ends: 76 [2018-11-14 16:35:25,591 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:35:25,595 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:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:35:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:35:25,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:25,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:25,642 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:25,643 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:25,648 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 16:35:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:35:25,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:25,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:25,650 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:25,650 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:25,657 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 16:35:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:35:25,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:25,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:25,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:25,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:35:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-14 16:35:25,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2018-11-14 16:35:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:25,670 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-14 16:35:25,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:35:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 16:35:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:35:25,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:25,674 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:25,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:25,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1783847450, now seen corresponding path program 1 times [2018-11-14 16:35:25,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:25,675 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:25,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:25,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:26,042 INFO L256 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {313#true} is VALID [2018-11-14 16:35:26,042 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:26,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2018-11-14 16:35:26,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #104#return; {313#true} is VALID [2018-11-14 16:35:26,043 INFO L256 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret11 := main(); {313#true} is VALID [2018-11-14 16:35:26,043 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:26,044 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:26,044 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:26,045 INFO L256 TraceCheckUtils]: 8: Hoare triple {333#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {313#true} is VALID [2018-11-14 16:35:26,045 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:26,046 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:26,047 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:26,048 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:26,056 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:26,058 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:26,058 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:26,059 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:26,059 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:26,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {314#false} assume true; {314#false} is VALID [2018-11-14 16:35:26,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {314#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {314#false} is VALID [2018-11-14 16:35:26,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {314#false} #res := ~len~0; {314#false} is VALID [2018-11-14 16:35:26,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {314#false} assume true; {314#false} is VALID [2018-11-14 16:35:26,060 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {314#false} {314#false} #100#return; {314#false} is VALID [2018-11-14 16:35:26,061 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:26,061 INFO L273 TraceCheckUtils]: 24: Hoare triple {314#false} assume !false; {314#false} is VALID [2018-11-14 16:35:26,065 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:26,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:26,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:26,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:35:26,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 16:35:26,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:26,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:35:26,116 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:26,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:35:26,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:35:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:35:26,117 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2018-11-14 16:35:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:26,718 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 16:35:26,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:35:26,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 16:35:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:35:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 16:35:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:35:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-14 16:35:26,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2018-11-14 16:35:26,891 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:26,895 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:35:26,896 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 16:35:26,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:35:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 16:35:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-14 16:35:26,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:26,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 36 states. [2018-11-14 16:35:26,932 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 36 states. [2018-11-14 16:35:26,932 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 36 states. [2018-11-14 16:35:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:26,938 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 16:35:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 16:35:26,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:26,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:26,940 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 43 states. [2018-11-14 16:35:26,940 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 43 states. [2018-11-14 16:35:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:26,944 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-14 16:35:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 16:35:26,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:26,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:26,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:26,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:35:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-14 16:35:26,950 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2018-11-14 16:35:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:26,950 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-14 16:35:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:35:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-14 16:35:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:35:26,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:26,952 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:26,952 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:26,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:26,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1176066432, now seen corresponding path program 1 times [2018-11-14 16:35:26,953 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:26,953 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:26,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:27,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:27,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID [2018-11-14 16:35:27,125 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:27,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:27,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {606#true} {606#true} #104#return; {606#true} is VALID [2018-11-14 16:35:27,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {606#true} call #t~ret11 := main(); {606#true} is VALID [2018-11-14 16:35:27,130 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:27,131 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:27,132 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:27,132 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:27,133 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:27,133 INFO L256 TraceCheckUtils]: 10: Hoare triple {633#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {606#true} is VALID [2018-11-14 16:35:27,134 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:27,134 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:27,135 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:27,136 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:27,139 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:27,143 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:27,143 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:27,143 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:27,144 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:27,144 INFO L273 TraceCheckUtils]: 20: Hoare triple {607#false} assume true; {607#false} is VALID [2018-11-14 16:35:27,144 INFO L273 TraceCheckUtils]: 21: Hoare triple {607#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {607#false} is VALID [2018-11-14 16:35:27,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {607#false} #res := ~len~0; {607#false} is VALID [2018-11-14 16:35:27,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {607#false} assume true; {607#false} is VALID [2018-11-14 16:35:27,145 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {607#false} {607#false} #100#return; {607#false} is VALID [2018-11-14 16:35:27,145 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:27,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {607#false} assume !false; {607#false} is VALID [2018-11-14 16:35:27,147 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:27,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:27,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {607#false} assume !false; {607#false} is VALID [2018-11-14 16:35:27,463 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:27,464 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {606#true} {607#false} #100#return; {607#false} is VALID [2018-11-14 16:35:27,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:27,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {606#true} #res := ~len~0; {606#true} is VALID [2018-11-14 16:35:27,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {606#true} is VALID [2018-11-14 16:35:27,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:27,465 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:27,465 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:27,466 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:27,468 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {653#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} #98#return; {607#false} is VALID [2018-11-14 16:35:27,469 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:27,470 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:27,471 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:27,472 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:27,477 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:27,477 INFO L256 TraceCheckUtils]: 10: Hoare triple {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {606#true} is VALID [2018-11-14 16:35:27,478 INFO L273 TraceCheckUtils]: 9: Hoare triple {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:27,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume true; {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:27,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {752#(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; {723#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:27,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {752#(bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))} assume true; {752#(bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:27,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {606#true} ~len~1 := 2bv32; {752#(bvsgt (bvadd main_~len~1 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:27,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {606#true} call #t~ret11 := main(); {606#true} is VALID [2018-11-14 16:35:27,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {606#true} {606#true} #104#return; {606#true} is VALID [2018-11-14 16:35:27,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {606#true} assume true; {606#true} is VALID [2018-11-14 16:35:27,486 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:27,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID [2018-11-14 16:35:27,490 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:27,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:27,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 16:35:27,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-14 16:35:27,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:27,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:27,623 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:27,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:27,625 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 9 states. [2018-11-14 16:35:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:28,235 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 16:35:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:35:28,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-14 16:35:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2018-11-14 16:35:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2018-11-14 16:35:28,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 70 transitions. [2018-11-14 16:35:28,434 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:28,437 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:35:28,437 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 16:35:28,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:35:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 16:35:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 30. [2018-11-14 16:35:28,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:28,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 30 states. [2018-11-14 16:35:28,508 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 30 states. [2018-11-14 16:35:28,508 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 30 states. [2018-11-14 16:35:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:28,512 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 16:35:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 16:35:28,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:28,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:28,514 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 48 states. [2018-11-14 16:35:28,514 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 48 states. [2018-11-14 16:35:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:28,518 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 16:35:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 16:35:28,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:28,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:28,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:28,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:35:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 16:35:28,523 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-11-14 16:35:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:28,524 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 16:35:28,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:35:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 16:35:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:35:28,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:28,526 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:28,526 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:28,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 375065118, now seen corresponding path program 1 times [2018-11-14 16:35:28,527 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:28,527 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:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:28,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:28,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {1006#true} call ULTIMATE.init(); {1006#true} is VALID [2018-11-14 16:35:28,825 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:28,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 16:35:28,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1006#true} {1006#true} #104#return; {1006#true} is VALID [2018-11-14 16:35:28,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {1006#true} call #t~ret11 := main(); {1006#true} is VALID [2018-11-14 16:35:28,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {1006#true} ~len~1 := 2bv32; {1006#true} is VALID [2018-11-14 16:35:28,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 16:35:28,827 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:28,827 INFO L256 TraceCheckUtils]: 8: Hoare triple {1006#true} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {1006#true} is VALID [2018-11-14 16:35:28,828 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:28,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {1006#true} assume true; {1006#true} is VALID [2018-11-14 16:35:28,831 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:28,832 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:28,834 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:28,834 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:28,836 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:28,837 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:28,838 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:28,839 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:28,841 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:28,841 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:28,855 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:28,858 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:28,859 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:28,860 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:28,861 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:28,863 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:28,863 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:28,863 INFO L273 TraceCheckUtils]: 28: Hoare triple {1007#false} assume !false; {1007#false} is VALID [2018-11-14 16:35:28,865 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:28,866 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:28,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:28,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 16:35:28,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-14 16:35:28,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:28,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:28,920 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:28,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:28,921 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-14 16:35:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:29,661 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-14 16:35:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:35:29,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-14 16:35:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-14 16:35:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-14 16:35:29,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2018-11-14 16:35:29,749 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:35:29,751 INFO L225 Difference]: With dead ends: 40 [2018-11-14 16:35:29,751 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:35:29,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:35:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:35:29,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-14 16:35:29,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:29,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-14 16:35:29,806 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-14 16:35:29,807 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-14 16:35:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:29,809 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 16:35:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 16:35:29,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:29,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:29,810 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-14 16:35:29,810 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-14 16:35:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:29,813 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 16:35:29,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 16:35:29,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:29,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:29,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:29,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:35:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-14 16:35:29,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-11-14 16:35:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:29,817 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-14 16:35:29,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:35:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-14 16:35:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:35:29,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:29,819 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:35:29,819 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:29,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1699724744, now seen corresponding path program 1 times [2018-11-14 16:35:29,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:29,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:29,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:30,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 16:35:30,011 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:35:30,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:35:30,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #104#return; {1277#true} is VALID [2018-11-14 16:35:30,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret11 := main(); {1277#true} is VALID [2018-11-14 16:35:30,013 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:35:30,013 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:35:30,014 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:35:30,014 INFO L256 TraceCheckUtils]: 8: Hoare triple {1297#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {1277#true} is VALID [2018-11-14 16:35:30,015 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:35:30,015 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:35:30,016 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:35:30,017 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:35:30,018 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:35:30,019 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:35:30,023 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:35:30,025 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:35:30,025 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:35:30,026 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:35:30,027 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:35:30,027 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:35:30,027 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:35:30,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 16:35:30,028 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:35:30,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 16:35:30,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {1278#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1278#false} is VALID [2018-11-14 16:35:30,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#false} #res := ~len~0; {1278#false} is VALID [2018-11-14 16:35:30,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 16:35:30,030 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1278#false} {1278#false} #100#return; {1278#false} is VALID [2018-11-14 16:35:30,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1278#false} is VALID [2018-11-14 16:35:30,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 16:35:30,032 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:35:30,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:30,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 16:35:30,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1278#false} is VALID [2018-11-14 16:35:30,380 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1277#true} {1278#false} #100#return; {1278#false} is VALID [2018-11-14 16:35:30,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:35:30,380 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#true} #res := ~len~0; {1277#true} is VALID [2018-11-14 16:35:30,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {1277#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1277#true} is VALID [2018-11-14 16:35:30,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:35:30,381 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:35:30,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:35:30,381 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:35:30,381 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:35:30,382 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:35:30,386 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1330#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1412#(bvsgt main_~len~1 (_ bv0 32))} #98#return; {1278#false} is VALID [2018-11-14 16:35:30,386 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:35:30,387 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:35:30,387 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:35:30,388 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:35:30,393 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:35:30,393 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:35:30,394 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:35:30,394 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:35:30,395 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:35:30,395 INFO L256 TraceCheckUtils]: 8: Hoare triple {1412#(bvsgt main_~len~1 (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {1277#true} is VALID [2018-11-14 16:35:30,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1412#(bvsgt main_~len~1 (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1412#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:30,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1412#(bvsgt main_~len~1 (_ bv0 32))} assume true; {1412#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:30,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} ~len~1 := 2bv32; {1412#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:30,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret11 := main(); {1277#true} is VALID [2018-11-14 16:35:30,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #104#return; {1277#true} is VALID [2018-11-14 16:35:30,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 16:35:30,397 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:35:30,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 16:35:30,401 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:35:30,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:30,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 16:35:30,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 16:35:30,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:30,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:30,520 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:35:30,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:30,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:30,522 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-11-14 16:35:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:31,320 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-14 16:35:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:35:31,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-11-14 16:35:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-14 16:35:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-14 16:35:31,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2018-11-14 16:35:31,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:31,490 INFO L225 Difference]: With dead ends: 62 [2018-11-14 16:35:31,491 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 16:35:31,492 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:35:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 16:35:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-11-14 16:35:31,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:31,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 36 states. [2018-11-14 16:35:31,608 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 36 states. [2018-11-14 16:35:31,608 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 36 states. [2018-11-14 16:35:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:31,611 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-14 16:35:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-14 16:35:31,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:31,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:31,613 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 46 states. [2018-11-14 16:35:31,613 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 46 states. [2018-11-14 16:35:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:31,616 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-14 16:35:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-14 16:35:31,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:31,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:31,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:31,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 16:35:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-14 16:35:31,619 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-11-14 16:35:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:31,619 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-14 16:35:31,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:35:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 16:35:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:35:31,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:31,621 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:35:31,621 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:31,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -496984976, now seen corresponding path program 2 times [2018-11-14 16:35:31,622 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:31,622 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:31,644 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:35:31,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:35:31,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:31,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:31,944 INFO L256 TraceCheckUtils]: 0: Hoare triple {1704#true} call ULTIMATE.init(); {1704#true} is VALID [2018-11-14 16:35:31,944 INFO L273 TraceCheckUtils]: 1: Hoare triple {1704#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1704#true} is VALID [2018-11-14 16:35:31,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {1704#true} assume true; {1704#true} is VALID [2018-11-14 16:35:31,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1704#true} {1704#true} #104#return; {1704#true} is VALID [2018-11-14 16:35:31,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {1704#true} call #t~ret11 := main(); {1704#true} is VALID [2018-11-14 16:35:31,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {1704#true} ~len~1 := 2bv32; {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:31,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:31,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:31,947 INFO L256 TraceCheckUtils]: 8: Hoare triple {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {1704#true} is VALID [2018-11-14 16:35:31,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1737#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:31,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {1737#(= |sll_create_#in~len| sll_create_~len)} assume true; {1737#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:31,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {1737#(= |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; {1737#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:31,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {1737#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1737#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:31,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {1737#(= |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; {1750#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:31,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {1750#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {1750#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:31,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {1750#(= (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; {1750#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:31,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {1750#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1750#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:31,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {1750#(= (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; {1763#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:35:31,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {1763#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume true; {1763#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:35:31,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {1763#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:31,988 INFO L273 TraceCheckUtils]: 20: Hoare triple {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:31,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:31,989 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {1724#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {1705#false} is VALID [2018-11-14 16:35:31,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {1705#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1705#false} is VALID [2018-11-14 16:35:31,989 INFO L256 TraceCheckUtils]: 24: Hoare triple {1705#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1705#false} is VALID [2018-11-14 16:35:31,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {1705#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1705#false} is VALID [2018-11-14 16:35:31,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {1705#false} assume true; {1705#false} is VALID [2018-11-14 16:35:31,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {1705#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; {1705#false} is VALID [2018-11-14 16:35:31,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {1705#false} assume true; {1705#false} is VALID [2018-11-14 16:35:31,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {1705#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1705#false} is VALID [2018-11-14 16:35:31,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {1705#false} #res := ~len~0; {1705#false} is VALID [2018-11-14 16:35:31,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {1705#false} assume true; {1705#false} is VALID [2018-11-14 16:35:31,991 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1705#false} {1705#false} #100#return; {1705#false} is VALID [2018-11-14 16:35:31,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {1705#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1705#false} is VALID [2018-11-14 16:35:31,991 INFO L273 TraceCheckUtils]: 34: Hoare triple {1705#false} assume !false; {1705#false} is VALID [2018-11-14 16:35:31,994 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:35:31,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:32,528 INFO L273 TraceCheckUtils]: 34: Hoare triple {1705#false} assume !false; {1705#false} is VALID [2018-11-14 16:35:32,529 INFO L273 TraceCheckUtils]: 33: Hoare triple {1705#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {1705#false} is VALID [2018-11-14 16:35:32,529 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1704#true} {1705#false} #100#return; {1705#false} is VALID [2018-11-14 16:35:32,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {1704#true} assume true; {1704#true} is VALID [2018-11-14 16:35:32,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {1704#true} #res := ~len~0; {1704#true} is VALID [2018-11-14 16:35:32,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {1704#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1704#true} is VALID [2018-11-14 16:35:32,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {1704#true} assume true; {1704#true} is VALID [2018-11-14 16:35:32,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {1704#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; {1704#true} is VALID [2018-11-14 16:35:32,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {1704#true} assume true; {1704#true} is VALID [2018-11-14 16:35:32,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {1704#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1704#true} is VALID [2018-11-14 16:35:32,531 INFO L256 TraceCheckUtils]: 24: Hoare triple {1705#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {1704#true} is VALID [2018-11-14 16:35:32,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {1705#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {1705#false} is VALID [2018-11-14 16:35:32,536 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} #98#return; {1705#false} is VALID [2018-11-14 16:35:32,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:32,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:32,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {1865#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1770#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:32,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1865#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {1865#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {1872#(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; {1865#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {1872#(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); {1872#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {1872#(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; {1872#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {1872#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {1872#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {1885#(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; {1872#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {1885#(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); {1885#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {1885#(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; {1885#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {1885#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {1885#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,555 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1885#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:32,555 INFO L256 TraceCheckUtils]: 8: Hoare triple {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {1704#true} is VALID [2018-11-14 16:35:32,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:32,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:32,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {1704#true} ~len~1 := 2bv32; {1852#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:32,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {1704#true} call #t~ret11 := main(); {1704#true} is VALID [2018-11-14 16:35:32,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1704#true} {1704#true} #104#return; {1704#true} is VALID [2018-11-14 16:35:32,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {1704#true} assume true; {1704#true} is VALID [2018-11-14 16:35:32,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {1704#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1704#true} is VALID [2018-11-14 16:35:32,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {1704#true} call ULTIMATE.init(); {1704#true} is VALID [2018-11-14 16:35:32,565 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:35:32,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:32,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-14 16:35:32,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-14 16:35:32,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:32,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:35:32,866 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:35:32,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:35:32,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:35:32,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:35:32,867 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-11-14 16:35:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:34,364 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 16:35:34,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:35:34,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-14 16:35:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:35:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-14 16:35:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:35:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-14 16:35:34,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2018-11-14 16:35:34,538 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:35:34,540 INFO L225 Difference]: With dead ends: 74 [2018-11-14 16:35:34,540 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:35:34,541 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:35:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:35:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2018-11-14 16:35:34,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:34,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 48 states. [2018-11-14 16:35:34,599 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 48 states. [2018-11-14 16:35:34,599 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 48 states. [2018-11-14 16:35:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:34,603 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-14 16:35:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-14 16:35:34,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:34,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:34,604 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 61 states. [2018-11-14 16:35:34,604 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 61 states. [2018-11-14 16:35:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:34,608 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-14 16:35:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-14 16:35:34,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:34,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:34,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:34,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:35:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-14 16:35:34,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2018-11-14 16:35:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:34,612 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-14 16:35:34,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:35:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 16:35:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:35:34,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:34,613 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:34,613 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:34,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash -915858776, now seen corresponding path program 3 times [2018-11-14 16:35:34,614 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:34,639 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:35:34,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 16:35:34,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:34,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:34,946 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 30 treesize of output 27 [2018-11-14 16:35:34,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:34,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:34,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-11-14 16:35:35,097 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:35:35,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,188 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 30 treesize of output 27 [2018-11-14 16:35:35,212 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:35:35,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-11-14 16:35:35,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:35:35,341 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,357 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:35,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:35:35,404 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:61, output treesize:25 [2018-11-14 16:35:35,477 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:35,663 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32))))) is different from true [2018-11-14 16:35:36,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {2222#true} call ULTIMATE.init(); {2222#true} is VALID [2018-11-14 16:35:36,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {2222#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2222#true} is VALID [2018-11-14 16:35:36,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:36,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2222#true} {2222#true} #104#return; {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {2222#true} call #t~ret11 := main(); {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {2222#true} ~len~1 := 2bv32; {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L256 TraceCheckUtils]: 8: Hoare triple {2222#true} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {2222#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2222#true} is VALID [2018-11-14 16:35:36,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:36,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {2222#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; {2222#true} is VALID [2018-11-14 16:35:36,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {2222#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2222#true} is VALID [2018-11-14 16:35:36,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {2222#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; {2222#true} is VALID [2018-11-14 16:35:36,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:36,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {2222#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; {2222#true} is VALID [2018-11-14 16:35:36,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {2222#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2275#(or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:35:36,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {2275#(or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= sll_create_~new_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; {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:36,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} assume true; {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:36,234 INFO L273 TraceCheckUtils]: 19: Hoare triple {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ 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; {2286#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:35:36,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {2286#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2286#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:35:36,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {2286#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ 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; {2293#(or (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:36,238 INFO L273 TraceCheckUtils]: 22: Hoare triple {2293#(or (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)))} assume true; {2293#(or (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:36,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {2293#(or (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)))} assume !~bvsgt32(~len, 0bv32); {2293#(or (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:36,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {2293#(or (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) (and (not (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2303#(or (and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))))} is VALID [2018-11-14 16:35:36,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {2303#(or (and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))))} assume true; {2303#(or (and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))))} is VALID [2018-11-14 16:35:36,242 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2303#(or (and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32))))} {2222#true} #98#return; {2310#(or (and (not (= (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret9.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret9.offset|)))} is VALID [2018-11-14 16:35:36,243 INFO L273 TraceCheckUtils]: 27: Hoare triple {2310#(or (and (not (= (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret9.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) (_ 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; {2314#(or (and (not (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:35:36,245 INFO L256 TraceCheckUtils]: 28: Hoare triple {2314#(or (and (not (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32))))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2318#(or (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-14 16:35:36,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {2318#(or (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2322#(or (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)) (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)))} is VALID [2018-11-14 16:35:36,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {2322#(or (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)) (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)))} assume true; {2322#(or (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)) (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)))} is VALID [2018-11-14 16:35:36,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {2322#(or (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|)) (and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ 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; {2329#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ 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|))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ 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:35:36,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {2329#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ 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|))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ 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; {2329#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ 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|))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ 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:35:36,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {2329#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ 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|))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ 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); {2336#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:36,254 INFO L273 TraceCheckUtils]: 34: Hoare triple {2336#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} #res := ~len~0; {2336#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:36,254 INFO L273 TraceCheckUtils]: 35: Hoare triple {2336#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} assume true; {2336#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:36,257 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2336#(or (and (exists ((v_prenex_5 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_5) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) (_ bv0 32)) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} {2314#(or (and (not (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32))) (and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (= main_~s~0.offset (_ bv0 32))))} #100#return; {2223#false} is VALID [2018-11-14 16:35:36,257 INFO L273 TraceCheckUtils]: 37: Hoare triple {2223#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {2223#false} is VALID [2018-11-14 16:35:36,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {2223#false} assume !false; {2223#false} is VALID [2018-11-14 16:35:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:35:36,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:37,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {2223#false} assume !false; {2223#false} is VALID [2018-11-14 16:35:37,445 INFO L273 TraceCheckUtils]: 37: Hoare triple {2223#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {2223#false} is VALID [2018-11-14 16:35:37,446 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2362#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} {2358#(or (not (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))))} #100#return; {2223#false} is VALID [2018-11-14 16:35:37,447 INFO L273 TraceCheckUtils]: 35: Hoare triple {2362#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} assume true; {2362#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,447 INFO L273 TraceCheckUtils]: 34: Hoare triple {2362#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} #res := ~len~0; {2362#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {2372#(or (not (= sll_length_~head.offset (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (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); {2362#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {2372#(or (not (= sll_length_~head.offset (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (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; {2372#(or (not (= sll_length_~head.offset (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (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:35:37,451 INFO L273 TraceCheckUtils]: 31: Hoare triple {2379#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (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; {2372#(or (not (= sll_length_~head.offset (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (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:35:37,451 INFO L273 TraceCheckUtils]: 30: Hoare triple {2379#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} assume true; {2379#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:37,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {2222#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2379#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:37,452 INFO L256 TraceCheckUtils]: 28: Hoare triple {2358#(or (not (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32))) (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); {2222#true} is VALID [2018-11-14 16:35:37,453 INFO L273 TraceCheckUtils]: 27: Hoare triple {2389#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|) (_ bv0 32))) (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; {2358#(or (not (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))))} is VALID [2018-11-14 16:35:37,454 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2396#(or (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))))} {2222#true} #98#return; {2389#(or (not (= (select (select |#memory_$Pointer$.offset| |main_#t~ret9.base|) |main_#t~ret9.offset|) (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_#t~ret9.base|) |main_#t~ret9.offset|))))} is VALID [2018-11-14 16:35:37,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {2396#(or (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))))} assume true; {2396#(or (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:37,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {2403#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))) (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; {2396#(or (not (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|) (_ bv0 32))))} is VALID [2018-11-14 16:35:37,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {2403#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume !~bvsgt32(~len, 0bv32); {2403#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:35:37,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {2403#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} assume true; {2403#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:35:37,466 INFO L273 TraceCheckUtils]: 21: Hoare triple {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ 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; {2403#(or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))))} is VALID [2018-11-14 16:35:37,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:37,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ 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; {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:37,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} assume true; {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:37,468 INFO L273 TraceCheckUtils]: 17: Hoare triple {2275#(or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= sll_create_~new_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; {2279#(or (not (= sll_create_~head~0.base (_ bv0 32))) (not (= (_ bv0 32) sll_create_~head~0.offset)))} is VALID [2018-11-14 16:35:37,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {2222#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2275#(or (not (= (_ bv0 32) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (_ bv0 32))))} is VALID [2018-11-14 16:35:37,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {2222#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; {2222#true} is VALID [2018-11-14 16:35:37,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:37,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {2222#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; {2222#true} is VALID [2018-11-14 16:35:37,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {2222#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2222#true} is VALID [2018-11-14 16:35:37,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {2222#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; {2222#true} is VALID [2018-11-14 16:35:37,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:37,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {2222#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2222#true} is VALID [2018-11-14 16:35:37,471 INFO L256 TraceCheckUtils]: 8: Hoare triple {2222#true} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {2222#true} is VALID [2018-11-14 16:35:37,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {2222#true} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2222#true} is VALID [2018-11-14 16:35:37,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:37,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {2222#true} ~len~1 := 2bv32; {2222#true} is VALID [2018-11-14 16:35:37,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {2222#true} call #t~ret11 := main(); {2222#true} is VALID [2018-11-14 16:35:37,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2222#true} {2222#true} #104#return; {2222#true} is VALID [2018-11-14 16:35:37,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {2222#true} assume true; {2222#true} is VALID [2018-11-14 16:35:37,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {2222#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2222#true} is VALID [2018-11-14 16:35:37,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {2222#true} call ULTIMATE.init(); {2222#true} is VALID [2018-11-14 16:35:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:35:37,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:37,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-11-14 16:35:37,479 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-11-14 16:35:37,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:37,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:35:37,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:37,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:35:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:35:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2018-11-14 16:35:37,577 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 20 states. [2018-11-14 16:35:47,021 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-11-14 16:35:47,436 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-14 16:35:48,277 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-11-14 16:35:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:48,629 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-11-14 16:35:48,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:35:48,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-11-14 16:35:48,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:35:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2018-11-14 16:35:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:35:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2018-11-14 16:35:48,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2018-11-14 16:35:48,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:48,732 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:35:48,732 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 16:35:48,733 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=87, Invalid=468, Unknown=1, NotChecked=44, Total=600 [2018-11-14 16:35:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 16:35:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 16:35:48,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:48,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 16:35:48,830 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 16:35:48,830 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 16:35:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:48,833 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 16:35:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 16:35:48,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:48,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:48,834 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 16:35:48,834 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 16:35:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:48,837 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 16:35:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 16:35:48,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:48,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:48,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:48,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:35:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-14 16:35:48,840 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 39 [2018-11-14 16:35:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:48,840 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-14 16:35:48,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:35:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-14 16:35:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:35:48,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:48,842 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:48,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:48,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1032038334, now seen corresponding path program 4 times [2018-11-14 16:35:48,843 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:48,843 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:48,863 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:35:48,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:35:48,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:48,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:49,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {2733#true} call ULTIMATE.init(); {2733#true} is VALID [2018-11-14 16:35:49,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {2733#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2733#true} is VALID [2018-11-14 16:35:49,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2733#true} {2733#true} #104#return; {2733#true} is VALID [2018-11-14 16:35:49,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {2733#true} call #t~ret11 := main(); {2733#true} is VALID [2018-11-14 16:35:49,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {2733#true} ~len~1 := 2bv32; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,080 INFO L273 TraceCheckUtils]: 7: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,081 INFO L256 TraceCheckUtils]: 8: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {2733#true} is VALID [2018-11-14 16:35:49,081 INFO L273 TraceCheckUtils]: 9: Hoare triple {2733#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2733#true} is VALID [2018-11-14 16:35:49,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {2733#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {2733#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,083 INFO L273 TraceCheckUtils]: 17: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {2733#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,084 INFO L273 TraceCheckUtils]: 23: Hoare triple {2733#true} assume !~bvsgt32(~len, 0bv32); {2733#true} is VALID [2018-11-14 16:35:49,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {2733#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2733#true} is VALID [2018-11-14 16:35:49,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,091 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2733#true} {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {2753#(= (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; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,092 INFO L256 TraceCheckUtils]: 28: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,092 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2826#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:35:49,093 INFO L273 TraceCheckUtils]: 30: Hoare triple {2826#(= sll_length_~len~0 (_ bv0 32))} assume true; {2826#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:35:49,093 INFO L273 TraceCheckUtils]: 31: Hoare triple {2826#(= 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; {2833#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,094 INFO L273 TraceCheckUtils]: 32: Hoare triple {2833#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2833#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,095 INFO L273 TraceCheckUtils]: 33: Hoare triple {2833#(= (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; {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,095 INFO L273 TraceCheckUtils]: 34: Hoare triple {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,096 INFO L273 TraceCheckUtils]: 35: Hoare triple {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {2850#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:35:49,098 INFO L273 TraceCheckUtils]: 37: Hoare triple {2850#(= (_ bv2 32) |sll_length_#res|)} assume true; {2850#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:35:49,101 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2850#(= (_ bv2 32) |sll_length_#res|)} {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #100#return; {2857#(and (= (bvadd |main_#t~ret10| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:49,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {2857#(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; {2734#false} is VALID [2018-11-14 16:35:49,103 INFO L273 TraceCheckUtils]: 40: Hoare triple {2734#false} assume !false; {2734#false} is VALID [2018-11-14 16:35:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:35:49,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:49,385 INFO L273 TraceCheckUtils]: 40: Hoare triple {2734#false} assume !false; {2734#false} is VALID [2018-11-14 16:35:49,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {2867#(= |main_#t~ret10| main_~len~1)} assume ~len~1 != #t~ret10;havoc #t~ret10; {2734#false} is VALID [2018-11-14 16:35:49,389 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2850#(= (_ bv2 32) |sll_length_#res|)} {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #100#return; {2867#(= |main_#t~ret10| main_~len~1)} is VALID [2018-11-14 16:35:49,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {2850#(= (_ bv2 32) |sll_length_#res|)} assume true; {2850#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:35:49,393 INFO L273 TraceCheckUtils]: 36: Hoare triple {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {2850#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-14 16:35:49,395 INFO L273 TraceCheckUtils]: 35: Hoare triple {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,395 INFO L273 TraceCheckUtils]: 34: Hoare triple {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,396 INFO L273 TraceCheckUtils]: 33: Hoare triple {2833#(= (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; {2840#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,396 INFO L273 TraceCheckUtils]: 32: Hoare triple {2833#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2833#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {2826#(= 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; {2833#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {2826#(= sll_length_~len~0 (_ bv0 32))} assume true; {2826#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:35:49,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {2733#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2826#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-14 16:35:49,398 INFO L256 TraceCheckUtils]: 28: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {2753#(= (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; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,400 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2733#true} {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} #98#return; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {2733#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2733#true} is VALID [2018-11-14 16:35:49,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {2733#true} assume !~bvsgt32(~len, 0bv32); {2733#true} is VALID [2018-11-14 16:35:49,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,401 INFO L273 TraceCheckUtils]: 21: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {2733#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,403 INFO L273 TraceCheckUtils]: 17: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {2733#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {2733#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2733#true} is VALID [2018-11-14 16:35:49,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {2733#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; {2733#true} is VALID [2018-11-14 16:35:49,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {2733#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2733#true} is VALID [2018-11-14 16:35:49,405 INFO L256 TraceCheckUtils]: 8: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {2733#true} is VALID [2018-11-14 16:35:49,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {2733#true} ~len~1 := 2bv32; {2753#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:49,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {2733#true} call #t~ret11 := main(); {2733#true} is VALID [2018-11-14 16:35:49,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2733#true} {2733#true} #104#return; {2733#true} is VALID [2018-11-14 16:35:49,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {2733#true} assume true; {2733#true} is VALID [2018-11-14 16:35:49,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {2733#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2733#true} is VALID [2018-11-14 16:35:49,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {2733#true} call ULTIMATE.init(); {2733#true} is VALID [2018-11-14 16:35:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 16:35:49,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:49,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:35:49,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 16:35:49,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:49,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:35:49,477 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:35:49,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:35:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:35:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:35:49,478 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-11-14 16:35:50,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:50,111 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-11-14 16:35:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:35:50,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 16:35:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:50,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-14 16:35:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:35:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2018-11-14 16:35:50,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2018-11-14 16:35:50,217 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:35:50,219 INFO L225 Difference]: With dead ends: 64 [2018-11-14 16:35:50,219 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:35:50,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 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:35:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:35:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-11-14 16:35:50,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:50,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 58 states. [2018-11-14 16:35:50,413 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 58 states. [2018-11-14 16:35:50,413 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 58 states. [2018-11-14 16:35:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:50,416 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 16:35:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 16:35:50,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:50,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:50,417 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 61 states. [2018-11-14 16:35:50,417 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 61 states. [2018-11-14 16:35:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:50,419 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 16:35:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 16:35:50,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:50,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:50,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:50,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:35:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-11-14 16:35:50,423 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 41 [2018-11-14 16:35:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:50,423 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-14 16:35:50,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:35:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-14 16:35:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:35:50,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:50,425 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:50,425 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:50,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash -15072578, now seen corresponding path program 1 times [2018-11-14 16:35:50,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:50,426 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:50,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:35:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:50,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:50,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {3281#true} call ULTIMATE.init(); {3281#true} is VALID [2018-11-14 16:35:50,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {3281#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3281#true} is VALID [2018-11-14 16:35:50,696 INFO L273 TraceCheckUtils]: 2: Hoare triple {3281#true} assume true; {3281#true} is VALID [2018-11-14 16:35:50,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3281#true} {3281#true} #104#return; {3281#true} is VALID [2018-11-14 16:35:50,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {3281#true} call #t~ret11 := main(); {3281#true} is VALID [2018-11-14 16:35:50,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {3281#true} ~len~1 := 2bv32; {3301#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {3301#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3301#(= (bvadd main_~len~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {3301#(= (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; {3308#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {3308#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3308#(= (bvadd main_~len~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {3308#(= (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; {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:50,701 INFO L256 TraceCheckUtils]: 12: Hoare triple {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {3281#true} is VALID [2018-11-14 16:35:50,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {3281#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3328#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:50,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {3328#(= |sll_create_#in~len| sll_create_~len)} assume true; {3328#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:50,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {3328#(= |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; {3328#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:50,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {3328#(= |sll_create_#in~len| sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3328#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 16:35:50,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {3328#(= |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; {3341#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:50,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {3341#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {3341#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:50,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {3341#(= (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; {3341#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:50,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {3341#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3341#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 16:35:50,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {3341#(= (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; {3354#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:35:50,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {3354#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume true; {3354#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} is VALID [2018-11-14 16:35:50,731 INFO L273 TraceCheckUtils]: 23: Hoare triple {3354#(= (bvadd |sll_create_#in~len| (_ bv4294967294 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:50,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:50,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:50,733 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {3315#(= (bvadd main_~len~1 (_ bv4294967292 32)) (_ bv0 32))} #98#return; {3282#false} is VALID [2018-11-14 16:35:50,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {3282#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {3282#false} is VALID [2018-11-14 16:35:50,733 INFO L256 TraceCheckUtils]: 28: Hoare triple {3282#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {3282#false} is VALID [2018-11-14 16:35:50,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {3282#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3282#false} is VALID [2018-11-14 16:35:50,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {3282#false} assume true; {3282#false} is VALID [2018-11-14 16:35:50,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {3282#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; {3282#false} is VALID [2018-11-14 16:35:50,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {3282#false} assume true; {3282#false} is VALID [2018-11-14 16:35:50,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {3282#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; {3282#false} is VALID [2018-11-14 16:35:50,734 INFO L273 TraceCheckUtils]: 34: Hoare triple {3282#false} assume true; {3282#false} is VALID [2018-11-14 16:35:50,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {3282#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3282#false} is VALID [2018-11-14 16:35:50,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {3282#false} #res := ~len~0; {3282#false} is VALID [2018-11-14 16:35:50,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {3282#false} assume true; {3282#false} is VALID [2018-11-14 16:35:50,735 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3282#false} {3282#false} #100#return; {3282#false} is VALID [2018-11-14 16:35:50,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {3282#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {3282#false} is VALID [2018-11-14 16:35:50,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {3282#false} assume !false; {3282#false} is VALID [2018-11-14 16:35:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:35:50,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:51,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {3282#false} assume !false; {3282#false} is VALID [2018-11-14 16:35:51,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {3282#false} assume ~len~1 != #t~ret10;havoc #t~ret10; {3282#false} is VALID [2018-11-14 16:35:51,276 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3281#true} {3282#false} #100#return; {3282#false} is VALID [2018-11-14 16:35:51,276 INFO L273 TraceCheckUtils]: 37: Hoare triple {3281#true} assume true; {3281#true} is VALID [2018-11-14 16:35:51,276 INFO L273 TraceCheckUtils]: 36: Hoare triple {3281#true} #res := ~len~0; {3281#true} is VALID [2018-11-14 16:35:51,276 INFO L273 TraceCheckUtils]: 35: Hoare triple {3281#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3281#true} is VALID [2018-11-14 16:35:51,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {3281#true} assume true; {3281#true} is VALID [2018-11-14 16:35:51,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {3281#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; {3281#true} is VALID [2018-11-14 16:35:51,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {3281#true} assume true; {3281#true} is VALID [2018-11-14 16:35:51,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {3281#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; {3281#true} is VALID [2018-11-14 16:35:51,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {3281#true} assume true; {3281#true} is VALID [2018-11-14 16:35:51,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {3281#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3281#true} is VALID [2018-11-14 16:35:51,278 INFO L256 TraceCheckUtils]: 28: Hoare triple {3282#false} call #t~ret10 := sll_length(~s~0.base, ~s~0.offset); {3281#true} is VALID [2018-11-14 16:35:51,278 INFO L273 TraceCheckUtils]: 27: Hoare triple {3282#false} ~s~0.base, ~s~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset; {3282#false} is VALID [2018-11-14 16:35:51,282 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} #98#return; {3282#false} is VALID [2018-11-14 16:35:51,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} assume true; {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:51,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:51,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {3468#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {3361#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:51,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {3468#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {3468#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {3475#(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; {3468#(or (bvsgt sll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,288 INFO L273 TraceCheckUtils]: 20: Hoare triple {3475#(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); {3475#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {3475#(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; {3475#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {3475#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {3475#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {3488#(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; {3475#(or (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {3488#(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); {3488#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {3488#(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; {3488#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {3488#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} assume true; {3488#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {3281#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3488#(or (bvsgt (bvadd sll_create_~len (_ bv4294967294 32)) (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-14 16:35:51,297 INFO L256 TraceCheckUtils]: 12: Hoare triple {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret9.base, #t~ret9.offset := sll_create(~bvadd32(1bv32, ~len~1)); {3281#true} is VALID [2018-11-14 16:35:51,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume !(~bvslt32(~len~1, 32bv32) && #t~nondet7 != 0bv32);havoc #t~nondet7; {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:51,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:51,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {3510#(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; {3455#(bvsgt (bvadd main_~len~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:51,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {3510#(bvsgt main_~len~1 (_ bv0 32))} assume true; {3510#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:51,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {3517#(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; {3510#(bvsgt main_~len~1 (_ bv0 32))} is VALID [2018-11-14 16:35:51,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {3517#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} assume true; {3517#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:51,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {3281#true} ~len~1 := 2bv32; {3517#(bvsgt (bvadd main_~len~1 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:51,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {3281#true} call #t~ret11 := main(); {3281#true} is VALID [2018-11-14 16:35:51,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3281#true} {3281#true} #104#return; {3281#true} is VALID [2018-11-14 16:35:51,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {3281#true} assume true; {3281#true} is VALID [2018-11-14 16:35:51,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {3281#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3281#true} is VALID [2018-11-14 16:35:51,304 INFO L256 TraceCheckUtils]: 0: Hoare triple {3281#true} call ULTIMATE.init(); {3281#true} is VALID [2018-11-14 16:35:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 16:35:51,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-14 16:35:51,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-14 16:35:51,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:51,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:35:51,450 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:35:51,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:35:51,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:35:51,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:35:51,451 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 15 states. [2018-11-14 16:35:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:53,862 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-14 16:35:53,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:35:53,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-11-14 16:35:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:35:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-14 16:35:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:35:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-14 16:35:53,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-14 16:35:54,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:54,038 INFO L225 Difference]: With dead ends: 96 [2018-11-14 16:35:54,038 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 16:35:54,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-14 16:35:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 16:35:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2018-11-14 16:35:54,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:54,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 52 states. [2018-11-14 16:35:54,099 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 52 states. [2018-11-14 16:35:54,099 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 52 states. [2018-11-14 16:35:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:54,103 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-14 16:35:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-11-14 16:35:54,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:54,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:54,105 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 73 states. [2018-11-14 16:35:54,105 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 73 states. [2018-11-14 16:35:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:54,108 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-14 16:35:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-11-14 16:35:54,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:54,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:54,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:54,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 16:35:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-14 16:35:54,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 41 [2018-11-14 16:35:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:54,112 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-14 16:35:54,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:35:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-14 16:35:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 16:35:54,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:54,113 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:54,113 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:54,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:54,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1011443876, now seen corresponding path program 5 times [2018-11-14 16:35:54,114 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:54,114 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:35:54,132 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-14 16:35:54,327 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-14 16:35:54,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-14 16:35:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 16:35:54,525 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 16:35:54,609 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-14 16:35:54,609 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 16:35:54,609 WARN L170 areAnnotationChecker]: sll_destroyENTRY has no Hoare annotation [2018-11-14 16:35:54,609 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2018-11-14 16:35:54,609 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: sll_createENTRY has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: sll_lengthENTRY has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2018-11-14 16:35:54,613 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2018-11-14 16:35:54,614 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L585-4 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L565-1 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L565-4 has no Hoare annotation [2018-11-14 16:35:54,615 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-14 16:35:54,616 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L593-4 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L593-4 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: sll_destroyEXIT has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-14 16:35:54,619 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: sll_createFINAL has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: sll_lengthFINAL has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: sll_createEXIT has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-14 16:35:54,620 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: sll_lengthEXIT has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2018-11-14 16:35:54,621 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2018-11-14 16:35:54,621 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:35:54,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:35:54 BoogieIcfgContainer [2018-11-14 16:35:54,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:35:54,635 INFO L168 Benchmark]: Toolchain (without parser) took 32787.54 ms. Allocated memory was 1.6 GB in the beginning and 2.5 GB in the end (delta: 963.6 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -647.3 MB). Peak memory consumption was 316.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,636 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:35:54,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.82 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -807.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,637 INFO L168 Benchmark]: Boogie Preprocessor took 116.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,637 INFO L168 Benchmark]: RCFGBuilder took 1040.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,638 INFO L168 Benchmark]: TraceAbstraction took 30824.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 216.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 82.5 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,644 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.82 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -807.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1040.10 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30824.44 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 216.5 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 82.5 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; VAL [len=2] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={1073879139:0}, new_head={1073879139:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={1073879139:0}, new_head={1073879139:0}] [L570] FCALL new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={1073879139:0}, len=2, malloc(sizeof(struct node))={1073879139:0}, new_head={1073879139:0}] [L565] COND TRUE len > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={1073879139:0}, len=2, malloc(sizeof(struct node))={-1462620000:0}, new_head={-1462620000:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={1073879139:0}, len=2, malloc(sizeof(struct node))={-1462620000:0}, new_head={-1462620000:0}] [L570] FCALL new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={-1462620000:0}, len=1, malloc(sizeof(struct node))={-1462620000:0}, new_head={-1462620000:0}] [L565] COND TRUE len > 0 [L566] EXPR, FCALL malloc(sizeof(struct node)) [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-1462620000:0}, len=1, malloc(sizeof(struct node))={2016978896:0}, new_head={2016978896:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-1462620000:0}, len=1, malloc(sizeof(struct node))={2016978896:0}, new_head={2016978896:0}] [L570] FCALL new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={2016978896:0}, len=0, malloc(sizeof(struct node))={2016978896:0}, new_head={2016978896:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={2016978896:0}, len=0, malloc(sizeof(struct node))={2016978896:0}, new_head={2016978896:0}] [L574] RET return head; VAL [\old(len)=3, \result={2016978896:0}, head={2016978896:0}, len=0, malloc(sizeof(struct node))={2016978896:0}, new_head={2016978896:0}] [L596] EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={2016978896:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={2016978896:0}] [L577] int len = 0; VAL [head={2016978896:0}, head={2016978896:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR, FCALL head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR, FCALL head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR, FCALL head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={2016978896:0}, len=3] [L582] RET return len; VAL [\result=3, head={2016978896:0}, head={0:0}, len=3] [L597] EXPR sll_length(s) VAL [len=2, s={2016978896:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={2016978896:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 50 locations, 1 error locations. UNSAFE Result, 30.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 20.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 290 SDtfs, 167 SDslu, 1385 SDs, 0 SdLazy, 644 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 423 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 74 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 333 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 489 ConstructedInterpolants, 8 QuantifiedInterpolants, 75513 SizeOfPredicates, 33 NumberOfNonLiveVariables, 766 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 88/162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...