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-Const.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:22:27,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:22:28,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:22:28,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:22:28,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:22:28,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:22:28,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:22:28,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:22:28,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:22:28,029 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:22:28,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:22:28,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:22:28,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:22:28,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:22:28,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:22:28,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:22:28,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:22:28,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:22:28,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:22:28,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:22:28,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:22:28,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:22:28,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:22:28,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:22:28,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:22:28,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:22:28,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:22:28,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:22:28,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:22:28,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:22:28,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:22:28,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:22:28,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:22:28,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:22:28,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:22:28,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:22:28,057 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:22:28,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:22:28,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:22:28,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:22:28,074 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:22:28,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:22:28,075 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:22:28,075 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:22:28,075 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:22:28,075 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:22:28,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:22:28,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:22:28,076 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:22:28,076 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:22:28,076 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:22:28,076 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:22:28,077 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:22:28,077 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:22:28,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:22:28,077 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:22:28,077 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:22:28,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:22:28,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:22:28,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:22:28,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:22:28,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:22:28,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:22:28,079 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:22:28,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:22:28,079 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:22:28,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:22:28,080 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:22:28,080 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:22:28,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:22:28,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:22:28,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:22:28,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:22:28,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:22:28,146 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:22:28,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:22:28,198 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1afff90/67e5ad3acfb74e1dac2379e8194f12de/FLAG19aca7453 [2018-11-14 18:22:28,722 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:22:28,725 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:22:28,740 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1afff90/67e5ad3acfb74e1dac2379e8194f12de/FLAG19aca7453 [2018-11-14 18:22:28,753 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1afff90/67e5ad3acfb74e1dac2379e8194f12de [2018-11-14 18:22:28,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:22:28,766 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:22:28,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:22:28,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:22:28,771 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:22:28,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:22:28" (1/1) ... [2018-11-14 18:22:28,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587d4353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:28, skipping insertion in model container [2018-11-14 18:22:28,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:22:28" (1/1) ... [2018-11-14 18:22:28,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:22:28,847 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:22:29,281 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:22:29,301 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:22:29,412 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:22:29,567 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:22:29,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29 WrapperNode [2018-11-14 18:22:29,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:22:29,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:22:29,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:22:29,569 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:22:29,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (1/1) ... [2018-11-14 18:22:29,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:22:29,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:22:29,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:22:29,715 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:22:29,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (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 18:22:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:22:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:22:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:22:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:22:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:22:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 18:22:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-14 18:22:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-14 18:22:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-14 18:22:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:22:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:22:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:22:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:22:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:22:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:22:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:22:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:22:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:22:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:22:29,802 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:22:29,804 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:22:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:22:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:22:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:22:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:22:29,805 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:22:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:22:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:22:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:22:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:22:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:22:29,806 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:22:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:22:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:22:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:22:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:22:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:22:29,807 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:22:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:22:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:22:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:22:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:22:29,808 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:22:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:22:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:22:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:22:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:22:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:22:29,809 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:22:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:22:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:22:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:22:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:22:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:22:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:22:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:22:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:22:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:22:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:22:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:22:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:22:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:22:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:22:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:22:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:22:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:22:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:22:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:22:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:22:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:22:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:22:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:22:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:22:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:22:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:22:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:22:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:22:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:22:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:22:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:22:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:22:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:22:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:22:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:22:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:22:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:22:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:22:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:22:29,824 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:22:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:22:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:22:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:22:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:22:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:22:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:22:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:22:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:22:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:22:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:22:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:22:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:22:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:22:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:22:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:22:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:22:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:22:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:22:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:22:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:22:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:22:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:22:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:22:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 18:22:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:22:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:22:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:22:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-14 18:22:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-14 18:22:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:22:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:22:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-14 18:22:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:22:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:22:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:22:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:22:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:22:31,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:22:31,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:22:31 BoogieIcfgContainer [2018-11-14 18:22:31,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:22:31,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:22:31,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:22:31,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:22:31,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:22:28" (1/3) ... [2018-11-14 18:22:31,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75186f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:22:31, skipping insertion in model container [2018-11-14 18:22:31,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:22:29" (2/3) ... [2018-11-14 18:22:31,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75186f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:22:31, skipping insertion in model container [2018-11-14 18:22:31,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:22:31" (3/3) ... [2018-11-14 18:22:31,102 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:22:31,113 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:22:31,123 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:22:31,142 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:22:31,177 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:22:31,178 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:22:31,178 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:22:31,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:22:31,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:22:31,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:22:31,179 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:22:31,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:22:31,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:22:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-14 18:22:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:22:31,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:31,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:31,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:31,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2001141171, now seen corresponding path program 1 times [2018-11-14 18:22:31,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:31,228 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 18:22:31,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:22:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:31,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:31,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-14 18:22:31,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {57#true} is VALID [2018-11-14 18:22:31,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-14 18:22:31,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #128#return; {57#true} is VALID [2018-11-14 18:22:31,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret17 := main(); {57#true} is VALID [2018-11-14 18:22:31,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {57#true} is VALID [2018-11-14 18:22:31,598 INFO L256 TraceCheckUtils]: 6: Hoare triple {57#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-14 18:22:31,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {57#true} is VALID [2018-11-14 18:22:31,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-14 18:22:31,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#false} is VALID [2018-11-14 18:22:31,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 18:22:31,601 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#false} {57#true} #120#return; {58#false} is VALID [2018-11-14 18:22:31,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {58#false} is VALID [2018-11-14 18:22:31,602 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {58#false} is VALID [2018-11-14 18:22:31,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {58#false} is VALID [2018-11-14 18:22:31,602 INFO L256 TraceCheckUtils]: 15: Hoare triple {58#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {58#false} is VALID [2018-11-14 18:22:31,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {58#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {58#false} is VALID [2018-11-14 18:22:31,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {58#false} is VALID [2018-11-14 18:22:31,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {58#false} is VALID [2018-11-14 18:22:31,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 18:22:31,604 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {58#false} {58#false} #126#return; {58#false} is VALID [2018-11-14 18:22:31,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {58#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {58#false} is VALID [2018-11-14 18:22:31,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {58#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {58#false} is VALID [2018-11-14 18:22:31,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-14 18:22:31,606 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {58#false} {58#false} #122#return; {58#false} is VALID [2018-11-14 18:22:31,606 INFO L273 TraceCheckUtils]: 25: Hoare triple {58#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {58#false} is VALID [2018-11-14 18:22:31,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {58#false} assume !true; {58#false} is VALID [2018-11-14 18:22:31,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {58#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {58#false} is VALID [2018-11-14 18:22:31,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-14 18:22:31,614 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 18:22:31,614 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): Stream closed [2018-11-14 18:22:31,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:22:31,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:22:31,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-14 18:22:31,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:22:31,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:22:31,877 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 18:22:31,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:22:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:22:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:22:31,892 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-14 18:22:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:32,684 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2018-11-14 18:22:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:22:32,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-14 18:22:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:22:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-14 18:22:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:22:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2018-11-14 18:22:32,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 116 transitions. [2018-11-14 18:22:33,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:33,130 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:22:33,130 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:22:33,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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 18:22:33,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:22:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 18:22:33,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:33,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 18:22:33,215 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:22:33,215 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:22:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:33,221 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 18:22:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 18:22:33,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:33,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:33,222 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:22:33,223 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:22:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:33,228 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 18:22:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 18:22:33,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:33,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:33,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:33,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:22:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-14 18:22:33,236 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 29 [2018-11-14 18:22:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:33,236 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-14 18:22:33,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:22:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 18:22:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:22:33,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:33,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:33,239 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2063953689, now seen corresponding path program 1 times [2018-11-14 18:22:33,240 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:33,240 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 18:22:33,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:22:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:33,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:33,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2018-11-14 18:22:33,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {407#true} is VALID [2018-11-14 18:22:33,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2018-11-14 18:22:33,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #128#return; {407#true} is VALID [2018-11-14 18:22:33,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret17 := main(); {407#true} is VALID [2018-11-14 18:22:33,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {407#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {427#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:22:33,495 INFO L256 TraceCheckUtils]: 6: Hoare triple {427#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {407#true} is VALID [2018-11-14 18:22:33,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {407#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {434#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:33,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(= |sll_create_#in~len| sll_create_~len)} assume true; {434#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:33,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {434#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:22:33,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:22:33,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:22:33,515 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {441#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {427#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #120#return; {408#false} is VALID [2018-11-14 18:22:33,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {408#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {408#false} is VALID [2018-11-14 18:22:33,516 INFO L256 TraceCheckUtils]: 14: Hoare triple {408#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {408#false} is VALID [2018-11-14 18:22:33,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {408#false} is VALID [2018-11-14 18:22:33,516 INFO L256 TraceCheckUtils]: 16: Hoare triple {408#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {408#false} is VALID [2018-11-14 18:22:33,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {408#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {408#false} is VALID [2018-11-14 18:22:33,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {408#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {408#false} is VALID [2018-11-14 18:22:33,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {408#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {408#false} is VALID [2018-11-14 18:22:33,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-14 18:22:33,518 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {408#false} {408#false} #126#return; {408#false} is VALID [2018-11-14 18:22:33,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {408#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {408#false} is VALID [2018-11-14 18:22:33,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {408#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {408#false} is VALID [2018-11-14 18:22:33,519 INFO L273 TraceCheckUtils]: 24: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-14 18:22:33,519 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {408#false} {408#false} #122#return; {408#false} is VALID [2018-11-14 18:22:33,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {408#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {408#false} is VALID [2018-11-14 18:22:33,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {408#false} assume true; {408#false} is VALID [2018-11-14 18:22:33,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {408#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {408#false} is VALID [2018-11-14 18:22:33,520 INFO L273 TraceCheckUtils]: 29: Hoare triple {408#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {408#false} is VALID [2018-11-14 18:22:33,520 INFO L273 TraceCheckUtils]: 30: Hoare triple {408#false} assume !false; {408#false} is VALID [2018-11-14 18:22:33,522 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 18:22:33,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:22:33,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:22:33,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:22:33,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 18:22:33,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:22:33,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:22:33,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:33,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:22:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:22:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:22:33,595 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 5 states. [2018-11-14 18:22:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:34,173 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-14 18:22:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:22:34,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-14 18:22:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:22:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-14 18:22:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:22:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-14 18:22:34,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2018-11-14 18:22:34,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:34,372 INFO L225 Difference]: With dead ends: 72 [2018-11-14 18:22:34,373 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 18:22:34,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:22:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 18:22:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-14 18:22:34,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:34,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-14 18:22:34,411 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-14 18:22:34,411 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-14 18:22:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:34,415 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 18:22:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:22:34,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:34,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:34,416 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-14 18:22:34,416 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-14 18:22:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:34,421 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-14 18:22:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-14 18:22:34,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:34,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:34,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:34,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:22:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-14 18:22:34,426 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2018-11-14 18:22:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:34,427 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-14 18:22:34,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:22:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 18:22:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:22:34,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:34,429 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:34,429 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:34,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1906005862, now seen corresponding path program 1 times [2018-11-14 18:22:34,431 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:34,431 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 18:22:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:22:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:34,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:34,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-14 18:22:34,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-14 18:22:34,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-14 18:22:34,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #128#return; {750#true} is VALID [2018-11-14 18:22:34,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret17 := main(); {750#true} is VALID [2018-11-14 18:22:34,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {770#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:22:34,695 INFO L256 TraceCheckUtils]: 6: Hoare triple {770#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {750#true} is VALID [2018-11-14 18:22:34,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:34,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} assume true; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:34,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:34,698 INFO L256 TraceCheckUtils]: 10: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {750#true} is VALID [2018-11-14 18:22:34,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {750#true} is VALID [2018-11-14 18:22:34,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {750#true} is VALID [2018-11-14 18:22:34,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {750#true} is VALID [2018-11-14 18:22:34,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-14 18:22:34,701 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {750#true} {777#(= |sll_create_#in~len| sll_create_~len)} #116#return; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:34,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {777#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-14 18:22:34,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {777#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 18:22:34,703 INFO L273 TraceCheckUtils]: 18: Hoare triple {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume true; {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-14 18:22:34,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {808#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:34,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:34,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:34,709 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {770#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #120#return; {751#false} is VALID [2018-11-14 18:22:34,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {751#false} is VALID [2018-11-14 18:22:34,710 INFO L256 TraceCheckUtils]: 24: Hoare triple {751#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {751#false} is VALID [2018-11-14 18:22:34,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {751#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {751#false} is VALID [2018-11-14 18:22:34,710 INFO L256 TraceCheckUtils]: 26: Hoare triple {751#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {751#false} is VALID [2018-11-14 18:22:34,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#false} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {751#false} is VALID [2018-11-14 18:22:34,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {751#false} is VALID [2018-11-14 18:22:34,711 INFO L273 TraceCheckUtils]: 29: Hoare triple {751#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {751#false} is VALID [2018-11-14 18:22:34,711 INFO L273 TraceCheckUtils]: 30: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-14 18:22:34,712 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {751#false} {751#false} #126#return; {751#false} is VALID [2018-11-14 18:22:34,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {751#false} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {751#false} is VALID [2018-11-14 18:22:34,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {751#false} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {751#false} is VALID [2018-11-14 18:22:34,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-14 18:22:34,713 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {751#false} {751#false} #122#return; {751#false} is VALID [2018-11-14 18:22:34,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {751#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {751#false} is VALID [2018-11-14 18:22:34,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-14 18:22:34,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {751#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {751#false} is VALID [2018-11-14 18:22:34,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {751#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {751#false} is VALID [2018-11-14 18:22:34,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-14 18:22:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:22:34,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:22:35,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-14 18:22:35,102 INFO L273 TraceCheckUtils]: 39: Hoare triple {751#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {751#false} is VALID [2018-11-14 18:22:35,102 INFO L273 TraceCheckUtils]: 38: Hoare triple {751#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {751#false} is VALID [2018-11-14 18:22:35,102 INFO L273 TraceCheckUtils]: 37: Hoare triple {751#false} assume true; {751#false} is VALID [2018-11-14 18:22:35,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {751#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {751#false} is VALID [2018-11-14 18:22:35,103 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {750#true} {751#false} #122#return; {751#false} is VALID [2018-11-14 18:22:35,103 INFO L273 TraceCheckUtils]: 34: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-14 18:22:35,104 INFO L273 TraceCheckUtils]: 33: Hoare triple {750#true} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {750#true} is VALID [2018-11-14 18:22:35,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {750#true} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {750#true} is VALID [2018-11-14 18:22:35,105 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {750#true} {750#true} #126#return; {750#true} is VALID [2018-11-14 18:22:35,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-14 18:22:35,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {750#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {750#true} is VALID [2018-11-14 18:22:35,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {750#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {750#true} is VALID [2018-11-14 18:22:35,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {750#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {750#true} is VALID [2018-11-14 18:22:35,107 INFO L256 TraceCheckUtils]: 26: Hoare triple {750#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {750#true} is VALID [2018-11-14 18:22:35,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {750#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {750#true} is VALID [2018-11-14 18:22:35,107 INFO L256 TraceCheckUtils]: 24: Hoare triple {751#false} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {750#true} is VALID [2018-11-14 18:22:35,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {751#false} is VALID [2018-11-14 18:22:35,115 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {933#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #120#return; {751#false} is VALID [2018-11-14 18:22:35,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:35,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:35,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {815#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:35,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume true; {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 18:22:35,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {946#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-14 18:22:35,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {953#(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 18:22:35,142 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {750#true} {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #116#return; {953#(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 18:22:35,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-14 18:22:35,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {750#true} is VALID [2018-11-14 18:22:35,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {750#true} is VALID [2018-11-14 18:22:35,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {750#true} is VALID [2018-11-14 18:22:35,144 INFO L256 TraceCheckUtils]: 10: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {750#true} is VALID [2018-11-14 18:22:35,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {953#(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); {953#(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 18:22:35,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {953#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume true; {953#(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 18:22:35,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {953#(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 18:22:35,146 INFO L256 TraceCheckUtils]: 6: Hoare triple {933#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {750#true} is VALID [2018-11-14 18:22:35,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {933#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:22:35,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret17 := main(); {750#true} is VALID [2018-11-14 18:22:35,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #128#return; {750#true} is VALID [2018-11-14 18:22:35,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-14 18:22:35,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-14 18:22:35,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-14 18:22:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 18:22:35,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:22:35,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 18:22:35,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 18:22:35,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:22:35,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:22:35,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:35,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:22:35,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:22:35,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:22:35,316 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 9 states. [2018-11-14 18:22:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:36,542 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-14 18:22:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:22:36,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-11-14 18:22:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:22:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-14 18:22:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:22:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2018-11-14 18:22:36,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2018-11-14 18:22:36,735 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 18:22:36,739 INFO L225 Difference]: With dead ends: 77 [2018-11-14 18:22:36,739 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:22:36,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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 18:22:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:22:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-11-14 18:22:36,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:36,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 47 states. [2018-11-14 18:22:36,793 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 47 states. [2018-11-14 18:22:36,793 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 47 states. [2018-11-14 18:22:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:36,797 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 18:22:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-14 18:22:36,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:36,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:36,799 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 50 states. [2018-11-14 18:22:36,799 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 50 states. [2018-11-14 18:22:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:36,802 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 18:22:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-14 18:22:36,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:36,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:36,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:36,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:22:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 18:22:36,810 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 41 [2018-11-14 18:22:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:36,811 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 18:22:36,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:22:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 18:22:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 18:22:36,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:36,813 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:36,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:36,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -705606875, now seen corresponding path program 2 times [2018-11-14 18:22:36,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:36,814 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 18:22:36,831 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:22:36,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:22:36,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:22:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:36,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:37,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:22:37,256 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 18:22:37,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:37,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:37,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:37,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-14 18:22:37,284 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:37,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-14 18:22:37,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 18:22:37,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:37,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:37,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:37,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-14 18:22:37,540 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:37,562 INFO L256 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1276#true} is VALID [2018-11-14 18:22:37,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {1276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1276#true} is VALID [2018-11-14 18:22:37,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,563 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #128#return; {1276#true} is VALID [2018-11-14 18:22:37,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret17 := main(); {1276#true} is VALID [2018-11-14 18:22:37,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {1276#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1296#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:22:37,564 INFO L256 TraceCheckUtils]: 6: Hoare triple {1296#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1276#true} is VALID [2018-11-14 18:22:37,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {1276#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1276#true} is VALID [2018-11-14 18:22:37,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {1276#true} assume !!~bvsgt32(~len, 0bv32); {1276#true} is VALID [2018-11-14 18:22:37,565 INFO L256 TraceCheckUtils]: 10: Hoare triple {1276#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1276#true} is VALID [2018-11-14 18:22:37,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {1276#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1276#true} is VALID [2018-11-14 18:22:37,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {1276#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1276#true} is VALID [2018-11-14 18:22:37,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {1276#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1276#true} is VALID [2018-11-14 18:22:37,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,566 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1276#true} {1276#true} #116#return; {1276#true} is VALID [2018-11-14 18:22:37,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {1276#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1276#true} is VALID [2018-11-14 18:22:37,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {1276#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1276#true} is VALID [2018-11-14 18:22:37,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {1276#true} assume !!~bvsgt32(~len, 0bv32); {1276#true} is VALID [2018-11-14 18:22:37,567 INFO L256 TraceCheckUtils]: 20: Hoare triple {1276#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1276#true} is VALID [2018-11-14 18:22:37,567 INFO L273 TraceCheckUtils]: 21: Hoare triple {1276#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1276#true} is VALID [2018-11-14 18:22:37,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {1276#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1276#true} is VALID [2018-11-14 18:22:37,568 INFO L273 TraceCheckUtils]: 23: Hoare triple {1276#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1276#true} is VALID [2018-11-14 18:22:37,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,569 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1276#true} {1276#true} #116#return; {1276#true} is VALID [2018-11-14 18:22:37,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {1276#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1276#true} is VALID [2018-11-14 18:22:37,569 INFO L273 TraceCheckUtils]: 27: Hoare triple {1276#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1276#true} is VALID [2018-11-14 18:22:37,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {1276#true} assume !~bvsgt32(~len, 0bv32); {1276#true} is VALID [2018-11-14 18:22:37,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {1276#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1276#true} is VALID [2018-11-14 18:22:37,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {1276#true} assume true; {1276#true} is VALID [2018-11-14 18:22:37,571 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1276#true} {1296#(= |main_~#s~0.offset| (_ bv0 32))} #120#return; {1296#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:22:37,571 INFO L273 TraceCheckUtils]: 33: Hoare triple {1296#(= |main_~#s~0.offset| (_ bv0 32))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {1296#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:22:37,572 INFO L256 TraceCheckUtils]: 34: Hoare triple {1296#(= |main_~#s~0.offset| (_ bv0 32))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1276#true} is VALID [2018-11-14 18:22:37,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {1276#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1387#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 18:22:37,572 INFO L256 TraceCheckUtils]: 36: Hoare triple {1387#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1276#true} is VALID [2018-11-14 18:22:37,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {1276#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 18:22:37,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 18:22:37,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {1394#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1401#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 18:22:37,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {1401#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {1401#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 18:22:37,577 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1401#(not (= (_ bv0 32) |node_create_#res.base|))} {1387#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #126#return; {1408#(and (not (= (_ bv0 32) |sll_append_#t~ret6.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 18:22:37,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {1408#(and (not (= (_ bv0 32) |sll_append_#t~ret6.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1412#(and (not (= sll_append_~new_last~0.base (_ bv0 32))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 18:22:37,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {1412#(and (not (= sll_append_~new_last~0.base (_ bv0 32))) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-14 18:22:37,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-14 18:22:37,591 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1416#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {1296#(= |main_~#s~0.offset| (_ bv0 32))} #122#return; {1423#(and (= |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 18:22:37,592 INFO L273 TraceCheckUtils]: 46: Hoare triple {1423#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {1427#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 18:22:37,592 INFO L273 TraceCheckUtils]: 47: Hoare triple {1427#(not (= (_ bv0 32) main_~ptr~0.base))} assume true; {1427#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-14 18:22:37,593 INFO L273 TraceCheckUtils]: 48: Hoare triple {1427#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1277#false} is VALID [2018-11-14 18:22:37,593 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1277#false} is VALID [2018-11-14 18:22:37,593 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2018-11-14 18:22:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 18:22:37,600 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:22:37,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:22:37,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-14 18:22:37,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-14 18:22:37,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:22:37,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:22:37,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:37,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:22:37,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:22:37,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:22:37,692 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 11 states. [2018-11-14 18:22:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:39,039 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 18:22:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:22:39,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-11-14 18:22:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:22:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-14 18:22:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:22:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-14 18:22:39,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2018-11-14 18:22:39,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:39,257 INFO L225 Difference]: With dead ends: 64 [2018-11-14 18:22:39,257 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 18:22:39,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:22:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 18:22:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-11-14 18:22:39,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:39,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 52 states. [2018-11-14 18:22:39,412 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 52 states. [2018-11-14 18:22:39,412 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 52 states. [2018-11-14 18:22:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:39,415 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-14 18:22:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-14 18:22:39,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:39,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:39,416 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 61 states. [2018-11-14 18:22:39,417 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 61 states. [2018-11-14 18:22:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:39,420 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-14 18:22:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-11-14 18:22:39,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:39,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:39,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:39,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 18:22:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-14 18:22:39,424 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 51 [2018-11-14 18:22:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:39,425 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-14 18:22:39,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:22:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-14 18:22:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 18:22:39,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:39,427 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:39,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:39,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash -705605201, now seen corresponding path program 1 times [2018-11-14 18:22:39,429 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:39,429 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 18:22:39,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:22:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:39,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:39,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:22:39,779 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 18:22:39,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:39,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:39,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:39,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-14 18:22:40,005 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 18:22:40,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:22:40,118 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 18:22:40,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:22:40,154 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 18:22:40,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-14 18:22:40,217 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:40,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:22:40,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:22:40,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 18:22:40,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-14 18:22:40,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-14 18:22:40,467 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:40,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:22:40,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:22:40,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:40,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-14 18:22:40,548 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:40,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2018-11-14 18:22:40,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {1725#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1725#true} is VALID [2018-11-14 18:22:40,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1725#true} {1725#true} #128#return; {1725#true} is VALID [2018-11-14 18:22:40,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {1725#true} call #t~ret17 := main(); {1725#true} is VALID [2018-11-14 18:22:40,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {1725#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:40,604 INFO L256 TraceCheckUtils]: 6: Hoare triple {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1725#true} is VALID [2018-11-14 18:22:40,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {1725#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1725#true} is VALID [2018-11-14 18:22:40,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {1725#true} assume !!~bvsgt32(~len, 0bv32); {1725#true} is VALID [2018-11-14 18:22:40,604 INFO L256 TraceCheckUtils]: 10: Hoare triple {1725#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1725#true} is VALID [2018-11-14 18:22:40,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1725#true} is VALID [2018-11-14 18:22:40,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {1725#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1725#true} is VALID [2018-11-14 18:22:40,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {1725#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1725#true} is VALID [2018-11-14 18:22:40,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,605 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1725#true} {1725#true} #116#return; {1725#true} is VALID [2018-11-14 18:22:40,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {1725#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1725#true} is VALID [2018-11-14 18:22:40,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {1725#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1725#true} is VALID [2018-11-14 18:22:40,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {1725#true} assume !!~bvsgt32(~len, 0bv32); {1725#true} is VALID [2018-11-14 18:22:40,606 INFO L256 TraceCheckUtils]: 20: Hoare triple {1725#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1725#true} is VALID [2018-11-14 18:22:40,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {1725#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1725#true} is VALID [2018-11-14 18:22:40,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {1725#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1725#true} is VALID [2018-11-14 18:22:40,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {1725#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1725#true} is VALID [2018-11-14 18:22:40,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,607 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1725#true} {1725#true} #116#return; {1725#true} is VALID [2018-11-14 18:22:40,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {1725#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1725#true} is VALID [2018-11-14 18:22:40,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {1725#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1725#true} is VALID [2018-11-14 18:22:40,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {1725#true} assume !~bvsgt32(~len, 0bv32); {1725#true} is VALID [2018-11-14 18:22:40,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {1725#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1725#true} is VALID [2018-11-14 18:22:40,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {1725#true} assume true; {1725#true} is VALID [2018-11-14 18:22:40,611 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1725#true} {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #120#return; {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:40,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:40,612 INFO L256 TraceCheckUtils]: 34: Hoare triple {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {1725#true} is VALID [2018-11-14 18:22:40,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {1725#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1836#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data) (= sll_append_~head.offset |sll_append_#in~head.offset|))} is VALID [2018-11-14 18:22:40,614 INFO L256 TraceCheckUtils]: 36: Hoare triple {1836#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data) (= sll_append_~head.offset |sll_append_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1725#true} is VALID [2018-11-14 18:22:40,615 INFO L273 TraceCheckUtils]: 37: Hoare triple {1725#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:22:40,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:22:40,624 INFO L273 TraceCheckUtils]: 39: Hoare triple {1843#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1850#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:22:40,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {1850#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1850#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:22:40,628 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1850#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1836#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= |sll_append_#in~data| sll_append_~data) (= sll_append_~head.offset |sll_append_#in~head.offset|))} #126#return; {1857#(and (= (select (select |#memory_int| |sll_append_#t~ret6.base|) |sll_append_#t~ret6.offset|) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret6.offset|))} is VALID [2018-11-14 18:22:40,630 INFO L273 TraceCheckUtils]: 42: Hoare triple {1857#(and (= (select (select |#memory_int| |sll_append_#t~ret6.base|) |sll_append_#t~ret6.offset|) |sll_append_#in~data|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (_ bv0 32) |sll_append_#t~ret6.offset|))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1861#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= sll_append_~new_last~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:22:40,632 INFO L273 TraceCheckUtils]: 43: Hoare triple {1861#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= (select (select |#memory_int| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) |sll_append_#in~data|) (= sll_append_~new_last~0.offset (_ bv0 32)))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} is VALID [2018-11-14 18:22:40,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} assume true; {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} is VALID [2018-11-14 18:22:40,635 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1865#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (_ bv0 32)) |sll_append_#in~data|))} {1745#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #122#return; {1872#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:40,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {1872#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {1876#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:22:40,638 INFO L273 TraceCheckUtils]: 47: Hoare triple {1876#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume true; {1876#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:22:40,639 INFO L273 TraceCheckUtils]: 48: Hoare triple {1876#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1883#(and (= |main_#t~mem14| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:40,641 INFO L273 TraceCheckUtils]: 49: Hoare triple {1883#(and (= |main_#t~mem14| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem14;havoc #t~mem14; {1726#false} is VALID [2018-11-14 18:22:40,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2018-11-14 18:22:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 18:22:40,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:22:40,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:22:40,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-14 18:22:40,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-14 18:22:40,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:22:40,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:22:40,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:40,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:22:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:22:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:22:40,757 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 12 states. [2018-11-14 18:22:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:42,879 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-11-14 18:22:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:22:42,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-14 18:22:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:22:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-14 18:22:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:22:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-14 18:22:42,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-14 18:22:43,028 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 18:22:43,031 INFO L225 Difference]: With dead ends: 61 [2018-11-14 18:22:43,031 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 18:22:43,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:22:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 18:22:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-11-14 18:22:43,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:43,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 53 states. [2018-11-14 18:22:43,085 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 53 states. [2018-11-14 18:22:43,085 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 53 states. [2018-11-14 18:22:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:43,090 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 18:22:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-14 18:22:43,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:43,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:43,090 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 59 states. [2018-11-14 18:22:43,091 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 59 states. [2018-11-14 18:22:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:43,093 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-14 18:22:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-14 18:22:43,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:43,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:43,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:43,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:22:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-14 18:22:43,097 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 51 [2018-11-14 18:22:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:43,097 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-14 18:22:43,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:22:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 18:22:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:22:43,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:43,099 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:43,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:43,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1113340754, now seen corresponding path program 1 times [2018-11-14 18:22:43,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:43,100 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 18:22:43,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:22:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:43,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:43,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:22:43,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:43,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:43,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 18:22:43,382 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:45,423 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-14 18:22:50,760 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:23:00,058 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:23:07,109 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 18:23:07,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:23:07,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:23:07,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-14 18:23:07,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-14 18:23:07,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:07,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:07,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:23:07,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2018-11-14 18:23:09,217 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:09,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:23:09,319 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 18:23:09,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:09,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:09,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:23:09,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-11-14 18:23:09,376 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:17,842 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |c_old(#valid)| node_create_~temp~0.base)))) is different from true [2018-11-14 18:23:23,968 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-14 18:23:29,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {2174#true} call ULTIMATE.init(); {2174#true} is VALID [2018-11-14 18:23:29,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {2174#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2174#true} is VALID [2018-11-14 18:23:29,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {2174#true} assume true; {2174#true} is VALID [2018-11-14 18:23:29,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2174#true} {2174#true} #128#return; {2174#true} is VALID [2018-11-14 18:23:29,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {2174#true} call #t~ret17 := main(); {2174#true} is VALID [2018-11-14 18:23:29,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {2174#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2194#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:23:29,611 INFO L256 TraceCheckUtils]: 6: Hoare triple {2194#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:23:29,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:23:29,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {2198#(= |#valid| |old(#valid)|)} assume true; {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:23:29,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {2198#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:23:29,618 INFO L256 TraceCheckUtils]: 10: Hoare triple {2198#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:23:29,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {2198#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,641 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {2198#(= |#valid| |old(#valid)|)} #116#return; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,645 INFO L273 TraceCheckUtils]: 19: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !!~bvsgt32(~len, 0bv32); {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-14 18:23:29,647 INFO L256 TraceCheckUtils]: 20: Hoare triple {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2198#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 18:23:29,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {2198#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-14 18:23:29,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} is VALID [2018-11-14 18:23:29,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {2245#(and (not (= (_ bv0 32) node_create_~temp~0.base)) (= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-14 18:23:29,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} assume true; {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} is VALID [2018-11-14 18:23:29,668 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2252#(and (= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|) (not (= (_ bv0 32) |node_create_#res.base|)))} {2214#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #116#return; {2259#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} is VALID [2018-11-14 18:23:29,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {2259#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 18:23:29,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 18:23:29,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} assume true; {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 18:23:29,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-14 18:23:29,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {2263#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~head~0.base (_ bv1 1)) |#valid|))) (not (= sll_create_~head~0.base (_ bv0 32))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-14 18:23:29,685 INFO L273 TraceCheckUtils]: 31: Hoare triple {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} assume true; {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} is VALID [2018-11-14 18:23:29,692 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2276#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#res.base| (_ bv1 1))))) (not (= (_ bv0 32) |sll_create_#res.base|)))} {2194#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)))} #120#return; {2283#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} is VALID [2018-11-14 18:23:29,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {2283#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |main_#t~ret11.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) |main_#t~ret11.base|)))} call write~$Pointer$(#t~ret11.base, #t~ret11.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret11.base, #t~ret11.offset; {2287#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 18:23:29,695 INFO L256 TraceCheckUtils]: 34: Hoare triple {2287#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_append(~#s~0.base, ~#s~0.offset, ~data~0); {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:23:29,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {2295#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:23:29,698 INFO L256 TraceCheckUtils]: 36: Hoare triple {2295#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:23:29,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {2291#(and (= |#valid| |old(#valid)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-14 18:23:29,701 INFO L273 TraceCheckUtils]: 38: Hoare triple {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-14 18:23:29,738 INFO L273 TraceCheckUtils]: 39: Hoare triple {2302#(and (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-14 18:23:29,739 INFO L273 TraceCheckUtils]: 40: Hoare triple {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume true; {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-14 18:23:29,741 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2309#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} {2295#(and (= |#valid| |old(#valid)|) (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} #126#return; {2316#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))))} is VALID [2018-11-14 18:23:29,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {2316#(and (= sll_append_~head.base |sll_append_#in~head.base|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32)))) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))))} ~new_last~0.base, ~new_last~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {2320#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-14 18:23:29,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {2320#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= |sll_append_#t~mem7.base| (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume 0bv32 == #t~mem7.base && 0bv32 == #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4bv32); {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-14 18:23:29,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} assume true; {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} is VALID [2018-11-14 18:23:29,751 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2324#(exists ((node_create_~temp~0.offset (_ BitVec 32)) (node_create_~temp~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |old(#memory_$Pointer$.base)| node_create_~temp~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base))))} {2287#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #122#return; {2175#false} is VALID [2018-11-14 18:23:29,751 INFO L273 TraceCheckUtils]: 46: Hoare triple {2175#false} call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset;~count~0 := 0bv32; {2175#false} is VALID [2018-11-14 18:23:29,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {2175#false} assume true; {2175#false} is VALID [2018-11-14 18:23:29,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {2175#false} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset;call #t~mem14 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {2175#false} is VALID [2018-11-14 18:23:29,752 INFO L273 TraceCheckUtils]: 49: Hoare triple {2175#false} assume !(~data~0 != #t~mem14);havoc #t~mem14;~ptr~0.base, ~ptr~0.offset := ~temp~2.base, ~temp~2.offset;#t~post15 := ~count~0;~count~0 := ~bvadd32(1bv32, #t~post15);havoc #t~post15; {2175#false} is VALID [2018-11-14 18:23:29,752 INFO L273 TraceCheckUtils]: 50: Hoare triple {2175#false} assume true; {2175#false} is VALID [2018-11-14 18:23:29,752 INFO L273 TraceCheckUtils]: 51: Hoare triple {2175#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {2175#false} is VALID [2018-11-14 18:23:29,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {2175#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {2175#false} is VALID [2018-11-14 18:23:29,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {2175#false} assume !false; {2175#false} is VALID [2018-11-14 18:23:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2018-11-14 18:23:29,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:23:36,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:23:36,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:23:36,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:23:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:23:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:23:36,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:23:59,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:23:59,605 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 18:23:59,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:59,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:59,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:59,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-14 18:23:59,630 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:08,882 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base (store (select |c_old(#memory_$Pointer$.base)| node_create_~temp~0.base) (_ bv4 32) (_ bv0 32))))) is different from true