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/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:21:01,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:21:01,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:21:01,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:21:01,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:21:01,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:21:01,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:21:01,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:21:01,299 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:21:01,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:21:01,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:21:01,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:21:01,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:21:01,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:21:01,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:21:01,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:21:01,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:21:01,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:21:01,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:21:01,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:21:01,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:21:01,315 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:21:01,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:21:01,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:21:01,318 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:21:01,319 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:21:01,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:21:01,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:21:01,322 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:21:01,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:21:01,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:21:01,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:21:01,324 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:21:01,324 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:21:01,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:21:01,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:21:01,326 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:21:01,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:21:01,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:21:01,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:21:01,343 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:21:01,344 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:21:01,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:21:01,344 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:21:01,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:21:01,345 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:21:01,345 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:21:01,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:21:01,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:21:01,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:21:01,346 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:21:01,346 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:21:01,346 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:21:01,346 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:21:01,347 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:21:01,347 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:21:01,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:21:01,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:21:01,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:21:01,348 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:21:01,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:21:01,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:21:01,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:21:01,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:21:01,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:21:01,349 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:21:01,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:21:01,349 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:21:01,349 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:21:01,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:21:01,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:21:01,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:21:01,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:21:01,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:21:01,417 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:21:01,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:01,485 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0349e06c0/82d50cbda1c84a0f98addf471e326aad/FLAGafcbf412a [2018-11-14 18:21:02,051 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:21:02,056 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:02,070 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0349e06c0/82d50cbda1c84a0f98addf471e326aad/FLAGafcbf412a [2018-11-14 18:21:02,088 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0349e06c0/82d50cbda1c84a0f98addf471e326aad [2018-11-14 18:21:02,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:21:02,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:21:02,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:21:02,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:21:02,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:21:02,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c522a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02, skipping insertion in model container [2018-11-14 18:21:02,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:21:02,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:21:02,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:21:02,632 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:21:02,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:21:02,892 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:21:02,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02 WrapperNode [2018-11-14 18:21:02,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:21:02,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:21:02,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:21:02,894 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:21:02,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:02,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:03,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (1/1) ... [2018-11-14 18:21:03,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:21:03,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:21:03,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:21:03,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:21:03,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (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:21:03,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:21:03,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:21:03,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:21:03,094 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:21:03,094 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:21:03,094 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 18:21:03,094 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-11-14 18:21:03,094 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-11-14 18:21:03,094 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-11-14 18:21:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-11-14 18:21:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:21:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:21:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:21:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:21:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:21:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:21:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:21:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:21:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:21:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:21:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:21:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:21:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:21:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:21:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:21:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:21:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:21:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:21:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:21:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:21:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:21:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:21:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:21:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:21:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:21:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:21:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:21:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:21:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:21:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:21:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:21:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:21:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:21:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:21:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:21:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:21:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:21:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:21:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:21:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:21:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:21:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:21:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:21:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:21:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:21:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:21:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:21:03,107 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:21:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:21:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:21:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:21:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:21:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:21:03,108 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:21:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:21:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:21:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:21:03,109 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:21:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:21:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:21:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:21:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:21:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:21:03,110 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:21:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:21:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:21:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:21:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:21:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:21:03,112 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:21:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:21:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:21:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:21:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:21:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:21:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:21:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:21:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:21:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:21:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:21:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:21:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:21:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:21:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:21:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:21:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:21:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:21:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-11-14 18:21:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:21:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:21:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:21:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:21:04,360 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:21:04,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:21:04 BoogieIcfgContainer [2018-11-14 18:21:04,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:21:04,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:21:04,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:21:04,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:21:04,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:21:02" (1/3) ... [2018-11-14 18:21:04,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5bc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:21:04, skipping insertion in model container [2018-11-14 18:21:04,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:02" (2/3) ... [2018-11-14 18:21:04,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc5bc29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:21:04, skipping insertion in model container [2018-11-14 18:21:04,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:21:04" (3/3) ... [2018-11-14 18:21:04,370 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:04,380 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:21:04,389 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:21:04,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:21:04,442 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:21:04,443 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:21:04,444 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:21:04,444 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:21:04,444 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:21:04,444 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:21:04,444 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:21:04,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:21:04,445 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:21:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-14 18:21:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:21:04,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:04,473 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:04,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:04,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:04,481 INFO L82 PathProgramCache]: Analyzing trace with hash -151826432, now seen corresponding path program 1 times [2018-11-14 18:21:04,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:04,486 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:21:04,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:04,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:05,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-14 18:21:05,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {59#true} is VALID [2018-11-14 18:21:05,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 18:21:05,132 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #158#return; {59#true} is VALID [2018-11-14 18:21:05,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret15 := main(); {59#true} is VALID [2018-11-14 18:21:05,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} ~len~0 := 2bv32;~data~0 := 1bv32; {59#true} is VALID [2018-11-14 18:21:05,134 INFO L256 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {59#true} is VALID [2018-11-14 18:21:05,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {59#true} is VALID [2018-11-14 18:21:05,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#true} assume !true; {60#false} is VALID [2018-11-14 18:21:05,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {60#false} is VALID [2018-11-14 18:21:05,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:21:05,150 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {60#false} {59#true} #148#return; {60#false} is VALID [2018-11-14 18:21:05,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {60#false} is VALID [2018-11-14 18:21:05,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:21:05,151 INFO L273 TraceCheckUtils]: 14: Hoare triple {60#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {60#false} is VALID [2018-11-14 18:21:05,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:21:05,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {60#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {60#false} is VALID [2018-11-14 18:21:05,152 INFO L256 TraceCheckUtils]: 17: Hoare triple {60#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {60#false} is VALID [2018-11-14 18:21:05,153 INFO L273 TraceCheckUtils]: 18: Hoare triple {60#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {60#false} is VALID [2018-11-14 18:21:05,153 INFO L273 TraceCheckUtils]: 19: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:21:05,153 INFO L273 TraceCheckUtils]: 20: Hoare triple {60#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {60#false} is VALID [2018-11-14 18:21:05,154 INFO L273 TraceCheckUtils]: 21: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:21:05,154 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {60#false} {60#false} #152#return; {60#false} is VALID [2018-11-14 18:21:05,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {60#false} is VALID [2018-11-14 18:21:05,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-14 18:21:05,165 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:21:05,166 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:05,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:05,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:21:05,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-14 18:21:05,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:05,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:21:05,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:05,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:21:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:21:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:21:05,317 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-14 18:21:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:05,759 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-14 18:21:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:21:05,759 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-14 18:21:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:21:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 18:21:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:21:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 18:21:05,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-14 18:21:06,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:06,163 INFO L225 Difference]: With dead ends: 95 [2018-11-14 18:21:06,164 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:21:06,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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:21:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:21:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 18:21:06,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:06,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 18:21:06,234 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:21:06,234 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:21:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:06,239 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 18:21:06,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 18:21:06,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:06,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:06,241 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:21:06,241 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:21:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:06,246 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 18:21:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 18:21:06,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:06,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:06,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:06,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:21:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-14 18:21:06,253 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 25 [2018-11-14 18:21:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:06,253 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-14 18:21:06,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:21:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 18:21:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:21:06,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:06,255 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] [2018-11-14 18:21:06,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:06,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash -369111295, now seen corresponding path program 1 times [2018-11-14 18:21:06,257 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:06,257 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:21:06,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:06,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:06,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-14 18:21:06,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {405#true} is VALID [2018-11-14 18:21:06,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-14 18:21:06,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #158#return; {405#true} is VALID [2018-11-14 18:21:06,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret15 := main(); {405#true} is VALID [2018-11-14 18:21:06,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} ~len~0 := 2bv32;~data~0 := 1bv32; {425#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:06,546 INFO L256 TraceCheckUtils]: 6: Hoare triple {425#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {405#true} is VALID [2018-11-14 18:21:06,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {405#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {432#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:06,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {432#(= dll_create_~len |dll_create_#in~len|)} assume true; {432#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:06,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {432#(= dll_create_~len |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:21:06,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:21:06,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} assume true; {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-14 18:21:06,581 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {439#(not (bvsgt |dll_create_#in~len| (_ bv0 32)))} {425#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {406#false} is VALID [2018-11-14 18:21:06,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {406#false} is VALID [2018-11-14 18:21:06,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 18:21:06,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#false} assume !~bvsge32(~i~0, 0bv32); {406#false} is VALID [2018-11-14 18:21:06,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {406#false} is VALID [2018-11-14 18:21:06,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 18:21:06,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {406#false} is VALID [2018-11-14 18:21:06,584 INFO L256 TraceCheckUtils]: 19: Hoare triple {406#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {406#false} is VALID [2018-11-14 18:21:06,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {406#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {406#false} is VALID [2018-11-14 18:21:06,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 18:21:06,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {406#false} assume !~bvsgt32(~index, 0bv32); {406#false} is VALID [2018-11-14 18:21:06,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {406#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {406#false} is VALID [2018-11-14 18:21:06,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 18:21:06,585 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {406#false} {406#false} #152#return; {406#false} is VALID [2018-11-14 18:21:06,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {406#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {406#false} is VALID [2018-11-14 18:21:06,586 INFO L273 TraceCheckUtils]: 27: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-14 18:21:06,588 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:21:06,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:06,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:06,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:21:06,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-14 18:21:06,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:06,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:21:06,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:21:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:21:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:21:06,694 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-14 18:21:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:07,382 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-14 18:21:07,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:21:07,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-14 18:21:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:21:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-14 18:21:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:21:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-14 18:21:07,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2018-11-14 18:21:07,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:07,612 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:21:07,613 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:21:07,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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:21:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:21:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-14 18:21:07,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:07,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-14 18:21:07,638 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-14 18:21:07,638 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-14 18:21:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:07,643 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 18:21:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 18:21:07,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:07,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:07,644 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-14 18:21:07,644 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-14 18:21:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:07,647 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 18:21:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 18:21:07,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:07,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:07,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:07,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:21:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-14 18:21:07,652 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 28 [2018-11-14 18:21:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:07,652 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-14 18:21:07,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:21:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 18:21:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:21:07,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:07,654 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:07,655 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:07,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:07,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2013669645, now seen corresponding path program 1 times [2018-11-14 18:21:07,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:07,656 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:21:07,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:07,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:07,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {754#true} call ULTIMATE.init(); {754#true} is VALID [2018-11-14 18:21:07,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {754#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {754#true} is VALID [2018-11-14 18:21:07,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {754#true} assume true; {754#true} is VALID [2018-11-14 18:21:07,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} #158#return; {754#true} is VALID [2018-11-14 18:21:07,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {754#true} call #t~ret15 := main(); {754#true} is VALID [2018-11-14 18:21:07,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {754#true} ~len~0 := 2bv32;~data~0 := 1bv32; {754#true} is VALID [2018-11-14 18:21:07,835 INFO L256 TraceCheckUtils]: 6: Hoare triple {754#true} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {754#true} is VALID [2018-11-14 18:21:07,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {754#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-14 18:21:07,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume true; {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-14 18:21:07,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-14 18:21:07,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-14 18:21:07,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} is VALID [2018-11-14 18:21:07,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {780#(and (= (_ bv0 32) dll_create_~head~0.base) (= (_ bv0 32) dll_create_~head~0.offset))} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {755#false} is VALID [2018-11-14 18:21:07,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {755#false} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {755#false} is VALID [2018-11-14 18:21:07,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-14 18:21:07,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {755#false} assume !~bvsgt32(~len, 0bv32); {755#false} is VALID [2018-11-14 18:21:07,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {755#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {755#false} is VALID [2018-11-14 18:21:07,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-14 18:21:07,844 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {755#false} {754#true} #148#return; {755#false} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {755#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {755#false} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {755#false} assume !~bvsge32(~i~0, 0bv32); {755#false} is VALID [2018-11-14 18:21:07,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {755#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {755#false} is VALID [2018-11-14 18:21:07,846 INFO L273 TraceCheckUtils]: 23: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-14 18:21:07,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {755#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {755#false} is VALID [2018-11-14 18:21:07,846 INFO L256 TraceCheckUtils]: 25: Hoare triple {755#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {755#false} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {755#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {755#false} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {755#false} assume !~bvsgt32(~index, 0bv32); {755#false} is VALID [2018-11-14 18:21:07,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {755#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {755#false} is VALID [2018-11-14 18:21:07,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {755#false} assume true; {755#false} is VALID [2018-11-14 18:21:07,848 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {755#false} {755#false} #152#return; {755#false} is VALID [2018-11-14 18:21:07,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {755#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {755#false} is VALID [2018-11-14 18:21:07,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {755#false} assume !false; {755#false} is VALID [2018-11-14 18:21:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:07,851 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:07,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:07,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:21:07,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-14 18:21:07,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:07,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:21:07,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:07,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:21:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:21:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:21:07,908 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-11-14 18:21:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:08,182 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2018-11-14 18:21:08,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:21:08,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-14 18:21:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:21:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 18:21:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:21:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2018-11-14 18:21:08,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2018-11-14 18:21:08,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:08,403 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:21:08,403 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:21:08,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:21:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:21:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-14 18:21:08,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:08,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-14 18:21:08,445 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-14 18:21:08,446 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-14 18:21:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:08,449 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 18:21:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 18:21:08,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:08,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:08,450 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-14 18:21:08,451 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-14 18:21:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:08,454 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 18:21:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 18:21:08,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:08,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:08,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:08,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:21:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-14 18:21:08,458 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 34 [2018-11-14 18:21:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:08,458 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-14 18:21:08,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:21:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 18:21:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:21:08,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:08,460 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:08,460 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:08,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2062442933, now seen corresponding path program 1 times [2018-11-14 18:21:08,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:08,461 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:21:08,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:08,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:08,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1127#true} is VALID [2018-11-14 18:21:08,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {1127#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1127#true} is VALID [2018-11-14 18:21:08,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-14 18:21:08,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1127#true} {1127#true} #158#return; {1127#true} is VALID [2018-11-14 18:21:08,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {1127#true} call #t~ret15 := main(); {1127#true} is VALID [2018-11-14 18:21:08,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {1127#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1147#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:08,808 INFO L256 TraceCheckUtils]: 6: Hoare triple {1147#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1127#true} is VALID [2018-11-14 18:21:08,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {1127#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume true; {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1154#(= dll_create_~len |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {1154#(= dll_create_~len |dll_create_#in~len|)} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume true; {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} is VALID [2018-11-14 18:21:08,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {1173#(= (bvadd dll_create_~len (_ bv1 32)) |dll_create_#in~len|)} assume !~bvsgt32(~len, 0bv32); {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:08,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:08,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:08,838 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1147#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {1128#false} is VALID [2018-11-14 18:21:08,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {1128#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1128#false} is VALID [2018-11-14 18:21:08,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-14 18:21:08,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {1128#false} assume !~bvsge32(~i~0, 0bv32); {1128#false} is VALID [2018-11-14 18:21:08,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {1128#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1128#false} is VALID [2018-11-14 18:21:08,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-14 18:21:08,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {1128#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1128#false} is VALID [2018-11-14 18:21:08,840 INFO L256 TraceCheckUtils]: 25: Hoare triple {1128#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1128#false} is VALID [2018-11-14 18:21:08,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {1128#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1128#false} is VALID [2018-11-14 18:21:08,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-14 18:21:08,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {1128#false} assume !~bvsgt32(~index, 0bv32); {1128#false} is VALID [2018-11-14 18:21:08,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {1128#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1128#false} is VALID [2018-11-14 18:21:08,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-14 18:21:08,841 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1128#false} {1128#false} #152#return; {1128#false} is VALID [2018-11-14 18:21:08,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {1128#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1128#false} is VALID [2018-11-14 18:21:08,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2018-11-14 18:21:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:08,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:21:09,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2018-11-14 18:21:09,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {1128#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1128#false} is VALID [2018-11-14 18:21:09,231 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1127#true} {1128#false} #152#return; {1128#false} is VALID [2018-11-14 18:21:09,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-14 18:21:09,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {1127#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1127#true} is VALID [2018-11-14 18:21:09,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {1127#true} assume !~bvsgt32(~index, 0bv32); {1127#true} is VALID [2018-11-14 18:21:09,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-14 18:21:09,233 INFO L273 TraceCheckUtils]: 26: Hoare triple {1127#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1127#true} is VALID [2018-11-14 18:21:09,233 INFO L256 TraceCheckUtils]: 25: Hoare triple {1128#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1127#true} is VALID [2018-11-14 18:21:09,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {1128#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1128#false} is VALID [2018-11-14 18:21:09,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-14 18:21:09,234 INFO L273 TraceCheckUtils]: 22: Hoare triple {1128#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1128#false} is VALID [2018-11-14 18:21:09,234 INFO L273 TraceCheckUtils]: 21: Hoare triple {1128#false} assume !~bvsge32(~i~0, 0bv32); {1128#false} is VALID [2018-11-14 18:21:09,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {1128#false} assume true; {1128#false} is VALID [2018-11-14 18:21:09,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {1128#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1128#false} is VALID [2018-11-14 18:21:09,239 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {1280#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #148#return; {1128#false} is VALID [2018-11-14 18:21:09,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:09,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:09,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(~len, 0bv32); {1180#(not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:21:09,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1293#(or (bvsgt dll_create_~len (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {1127#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1300#(or (bvsgt (bvadd dll_create_~len (_ bv4294967295 32)) (_ bv0 32)) (not (bvsgt (bvadd |dll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:21:09,251 INFO L256 TraceCheckUtils]: 6: Hoare triple {1280#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1127#true} is VALID [2018-11-14 18:21:09,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {1127#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1280#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:09,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {1127#true} call #t~ret15 := main(); {1127#true} is VALID [2018-11-14 18:21:09,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1127#true} {1127#true} #158#return; {1127#true} is VALID [2018-11-14 18:21:09,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {1127#true} assume true; {1127#true} is VALID [2018-11-14 18:21:09,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {1127#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1127#true} is VALID [2018-11-14 18:21:09,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1127#true} is VALID [2018-11-14 18:21:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:09,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:21:09,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-14 18:21:09,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-14 18:21:09,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:09,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:21:09,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:09,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:21:09,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:21:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:21:09,406 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-11-14 18:21:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:10,463 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-11-14 18:21:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:21:10,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-11-14 18:21:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:21:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-14 18:21:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:21:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2018-11-14 18:21:10,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2018-11-14 18:21:10,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:10,655 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:21:10,655 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:21:10,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:21:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:21:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-11-14 18:21:10,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:10,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 50 states. [2018-11-14 18:21:10,676 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 50 states. [2018-11-14 18:21:10,677 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 50 states. [2018-11-14 18:21:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:10,681 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 18:21:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 18:21:10,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:10,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:10,682 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 54 states. [2018-11-14 18:21:10,682 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 54 states. [2018-11-14 18:21:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:10,685 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-14 18:21:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-14 18:21:10,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:10,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:10,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:10,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:21:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-14 18:21:10,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 34 [2018-11-14 18:21:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:10,690 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-14 18:21:10,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:21:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-14 18:21:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:21:10,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:10,692 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:21:10,692 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:10,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash 919460055, now seen corresponding path program 1 times [2018-11-14 18:21:10,693 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:10,693 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:21:10,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:10,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:10,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {1628#true} call ULTIMATE.init(); {1628#true} is VALID [2018-11-14 18:21:10,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {1628#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1628#true} is VALID [2018-11-14 18:21:10,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-14 18:21:10,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1628#true} {1628#true} #158#return; {1628#true} is VALID [2018-11-14 18:21:10,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {1628#true} call #t~ret15 := main(); {1628#true} is VALID [2018-11-14 18:21:10,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {1628#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:10,878 INFO L256 TraceCheckUtils]: 6: Hoare triple {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := dll_create(~len~0, ~data~0); {1628#true} is VALID [2018-11-14 18:21:10,878 INFO L273 TraceCheckUtils]: 7: Hoare triple {1628#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1628#true} is VALID [2018-11-14 18:21:10,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-14 18:21:10,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {1628#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1628#true} is VALID [2018-11-14 18:21:10,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {1628#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1628#true} is VALID [2018-11-14 18:21:10,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {1628#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1628#true} is VALID [2018-11-14 18:21:10,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {1628#true} assume !(~head~0.base != 0bv32 || ~head~0.offset != 0bv32); {1628#true} is VALID [2018-11-14 18:21:10,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {1628#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1628#true} is VALID [2018-11-14 18:21:10,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-14 18:21:10,880 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#true} assume !!~bvsgt32(~len, 0bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1628#true} is VALID [2018-11-14 18:21:10,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {1628#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1628#true} is VALID [2018-11-14 18:21:10,881 INFO L273 TraceCheckUtils]: 17: Hoare triple {1628#true} call write~intINTTYPE4(~data, ~new_head~0.base, ~new_head~0.offset, 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~new_head~0.base, ~bvadd32(8bv32, ~new_head~0.offset), 4bv32); {1628#true} is VALID [2018-11-14 18:21:10,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {1628#true} assume ~head~0.base != 0bv32 || ~head~0.offset != 0bv32;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32); {1628#true} is VALID [2018-11-14 18:21:10,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {1628#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post4 := ~len;~len := ~bvsub32(#t~post4, 1bv32);havoc #t~post4; {1628#true} is VALID [2018-11-14 18:21:10,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-14 18:21:10,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {1628#true} assume !~bvsgt32(~len, 0bv32); {1628#true} is VALID [2018-11-14 18:21:10,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {1628#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1628#true} is VALID [2018-11-14 18:21:10,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-14 18:21:10,883 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1628#true} {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #148#return; {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:10,884 INFO L273 TraceCheckUtils]: 25: Hoare triple {1648#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~bvsub32(~len~0, 1bv32); {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:10,885 INFO L273 TraceCheckUtils]: 26: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:21:10,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsge32(~i~0, 0bv32); {1629#false} is VALID [2018-11-14 18:21:10,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {1629#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1629#false} is VALID [2018-11-14 18:21:10,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {1629#false} assume true; {1629#false} is VALID [2018-11-14 18:21:10,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {1629#false} assume !!~bvsle32(~i~0, 0bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1629#false} is VALID [2018-11-14 18:21:10,889 INFO L256 TraceCheckUtils]: 31: Hoare triple {1629#false} call #t~ret14 := dll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1629#false} is VALID [2018-11-14 18:21:10,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {1629#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1629#false} is VALID [2018-11-14 18:21:10,890 INFO L273 TraceCheckUtils]: 33: Hoare triple {1629#false} assume true; {1629#false} is VALID [2018-11-14 18:21:10,890 INFO L273 TraceCheckUtils]: 34: Hoare triple {1629#false} assume !~bvsgt32(~index, 0bv32); {1629#false} is VALID [2018-11-14 18:21:10,890 INFO L273 TraceCheckUtils]: 35: Hoare triple {1629#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1629#false} is VALID [2018-11-14 18:21:10,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {1629#false} assume true; {1629#false} is VALID [2018-11-14 18:21:10,891 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1629#false} {1629#false} #152#return; {1629#false} is VALID [2018-11-14 18:21:10,891 INFO L273 TraceCheckUtils]: 38: Hoare triple {1629#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1629#false} is VALID [2018-11-14 18:21:10,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {1629#false} assume !false; {1629#false} is VALID [2018-11-14 18:21:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:21:10,894 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:10,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:10,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:21:10,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:21:10,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:10,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:21:11,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:11,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:21:11,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:21:11,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:21:11,003 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-11-14 18:21:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:11,251 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-11-14 18:21:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:21:11,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:21:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:21:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:21:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 18:21:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:21:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-14 18:21:11,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-14 18:21:11,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:11,343 INFO L225 Difference]: With dead ends: 57 [2018-11-14 18:21:11,343 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:21:11,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:21:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:21:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:21:11,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:21:11,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:21:11,345 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:21:11,346 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:21:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:11,346 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:21:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:21:11,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:11,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:11,346 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:21:11,347 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:21:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:21:11,347 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:21:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:21:11,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:11,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:21:11,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:21:11,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:21:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:21:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:21:11,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-11-14 18:21:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:21:11,348 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:21:11,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:21:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:21:11,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:21:11,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:21:11,616 INFO L425 ceAbstractionStarter]: For program point L607-1(lines 607 610) no Hoare annotation was computed. [2018-11-14 18:21:11,616 INFO L428 ceAbstractionStarter]: At program point L607-3(lines 607 610) the Hoare annotation is: true [2018-11-14 18:21:11,617 INFO L425 ceAbstractionStarter]: For program point L607-4(lines 607 610) no Hoare annotation was computed. [2018-11-14 18:21:11,617 INFO L428 ceAbstractionStarter]: At program point dll_update_atENTRY(lines 606 612) the Hoare annotation is: true [2018-11-14 18:21:11,617 INFO L425 ceAbstractionStarter]: For program point dll_update_atEXIT(lines 606 612) no Hoare annotation was computed. [2018-11-14 18:21:11,617 INFO L425 ceAbstractionStarter]: For program point dll_update_atFINAL(lines 606 612) no Hoare annotation was computed. [2018-11-14 18:21:11,617 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-14 18:21:11,617 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-14 18:21:11,618 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-14 18:21:11,618 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-14 18:21:11,618 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:21:11,618 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:21:11,618 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:21:11,618 INFO L425 ceAbstractionStarter]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2018-11-14 18:21:11,618 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 576 589) no Hoare annotation was computed. [2018-11-14 18:21:11,619 INFO L428 ceAbstractionStarter]: At program point dll_createENTRY(lines 574 591) the Hoare annotation is: true [2018-11-14 18:21:11,619 INFO L428 ceAbstractionStarter]: At program point L576-3(lines 576 589) the Hoare annotation is: true [2018-11-14 18:21:11,619 INFO L425 ceAbstractionStarter]: For program point L576-4(lines 576 589) no Hoare annotation was computed. [2018-11-14 18:21:11,619 INFO L425 ceAbstractionStarter]: For program point dll_createFINAL(lines 574 591) no Hoare annotation was computed. [2018-11-14 18:21:11,619 INFO L428 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-11-14 18:21:11,619 INFO L425 ceAbstractionStarter]: For program point dll_createEXIT(lines 574 591) no Hoare annotation was computed. [2018-11-14 18:21:11,619 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 586) no Hoare annotation was computed. [2018-11-14 18:21:11,620 INFO L425 ceAbstractionStarter]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2018-11-14 18:21:11,620 INFO L425 ceAbstractionStarter]: For program point L578(lines 578 580) no Hoare annotation was computed. [2018-11-14 18:21:11,620 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2018-11-14 18:21:11,620 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2018-11-14 18:21:11,620 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2018-11-14 18:21:11,620 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2018-11-14 18:21:11,621 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2018-11-14 18:21:11,621 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2018-11-14 18:21:11,621 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:21:11,621 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:21:11,621 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:21:11,621 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:21:11,621 INFO L425 ceAbstractionStarter]: For program point L600-1(lines 600 603) no Hoare annotation was computed. [2018-11-14 18:21:11,622 INFO L428 ceAbstractionStarter]: At program point L600-3(lines 600 603) the Hoare annotation is: true [2018-11-14 18:21:11,622 INFO L425 ceAbstractionStarter]: For program point L600-4(lines 600 603) no Hoare annotation was computed. [2018-11-14 18:21:11,622 INFO L425 ceAbstractionStarter]: For program point dll_get_data_atFINAL(lines 599 605) no Hoare annotation was computed. [2018-11-14 18:21:11,622 INFO L428 ceAbstractionStarter]: At program point dll_get_data_atENTRY(lines 599 605) the Hoare annotation is: true [2018-11-14 18:21:11,622 INFO L425 ceAbstractionStarter]: For program point dll_get_data_atEXIT(lines 599 605) no Hoare annotation was computed. [2018-11-14 18:21:11,622 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 613 632) no Hoare annotation was computed. [2018-11-14 18:21:11,622 INFO L425 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-11-14 18:21:11,623 INFO L421 ceAbstractionStarter]: At program point L624(line 624) the Hoare annotation is: false [2018-11-14 18:21:11,623 INFO L425 ceAbstractionStarter]: For program point L624-1(lines 624 626) no Hoare annotation was computed. [2018-11-14 18:21:11,623 INFO L425 ceAbstractionStarter]: For program point L622-1(lines 622 627) no Hoare annotation was computed. [2018-11-14 18:21:11,623 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 613 632) no Hoare annotation was computed. [2018-11-14 18:21:11,623 INFO L421 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-14 18:21:11,623 INFO L425 ceAbstractionStarter]: For program point L620-1(lines 618 621) no Hoare annotation was computed. [2018-11-14 18:21:11,623 INFO L425 ceAbstractionStarter]: For program point L622-3(lines 622 627) no Hoare annotation was computed. [2018-11-14 18:21:11,624 INFO L421 ceAbstractionStarter]: At program point L622-4(lines 622 627) the Hoare annotation is: (and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-14 18:21:11,624 INFO L425 ceAbstractionStarter]: For program point L618-1(lines 618 621) no Hoare annotation was computed. [2018-11-14 18:21:11,624 INFO L428 ceAbstractionStarter]: At program point L622-5(lines 622 627) the Hoare annotation is: true [2018-11-14 18:21:11,624 INFO L421 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-14 18:21:11,624 INFO L425 ceAbstractionStarter]: For program point L616-1(line 616) no Hoare annotation was computed. [2018-11-14 18:21:11,624 INFO L421 ceAbstractionStarter]: At program point L618-3(lines 618 621) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-14 18:21:11,625 INFO L425 ceAbstractionStarter]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2018-11-14 18:21:11,625 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 613 632) the Hoare annotation is: true [2018-11-14 18:21:11,625 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2018-11-14 18:21:11,625 INFO L421 ceAbstractionStarter]: At program point L625(lines 613 632) the Hoare annotation is: false [2018-11-14 18:21:11,625 INFO L425 ceAbstractionStarter]: For program point dll_destroyEXIT(lines 592 598) no Hoare annotation was computed. [2018-11-14 18:21:11,625 INFO L428 ceAbstractionStarter]: At program point dll_destroyENTRY(lines 592 598) the Hoare annotation is: true [2018-11-14 18:21:11,626 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 597) no Hoare annotation was computed. [2018-11-14 18:21:11,626 INFO L428 ceAbstractionStarter]: At program point L593-3(lines 593 597) the Hoare annotation is: true [2018-11-14 18:21:11,626 INFO L425 ceAbstractionStarter]: For program point L593-4(lines 592 598) no Hoare annotation was computed. [2018-11-14 18:21:11,626 INFO L425 ceAbstractionStarter]: For program point node_createENTRY(lines 564 573) no Hoare annotation was computed. [2018-11-14 18:21:11,626 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-11-14 18:21:11,626 INFO L425 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-11-14 18:21:11,626 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-14 18:21:11,627 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-11-14 18:21:11,627 INFO L425 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-14 18:21:11,629 WARN L170 areAnnotationChecker]: L562 has no Hoare annotation [2018-11-14 18:21:11,629 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:21:11,629 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2018-11-14 18:21:11,629 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2018-11-14 18:21:11,645 WARN L170 areAnnotationChecker]: node_createENTRY has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: L576-4 has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2018-11-14 18:21:11,646 WARN L170 areAnnotationChecker]: L600-4 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L616-1 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L593-4 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L566 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:21:11,647 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L576-1 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L576-4 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L600-4 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L616-1 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-14 18:21:11,648 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: L593-4 has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: L566-1 has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: dll_update_atFINAL has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-14 18:21:11,649 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: dll_createFINAL has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: dll_get_data_atFINAL has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: dll_destroyEXIT has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: node_createFINAL has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: dll_update_atEXIT has no Hoare annotation [2018-11-14 18:21:11,650 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: dll_createEXIT has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: dll_get_data_atEXIT has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2018-11-14 18:21:11,651 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-14 18:21:11,652 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: L622-3 has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2018-11-14 18:21:11,653 WARN L170 areAnnotationChecker]: L628 has no Hoare annotation [2018-11-14 18:21:11,654 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:21:11,654 WARN L170 areAnnotationChecker]: L624-1 has no Hoare annotation [2018-11-14 18:21:11,654 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:21:11,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:21:11 BoogieIcfgContainer [2018-11-14 18:21:11,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:21:11,666 INFO L168 Benchmark]: Toolchain (without parser) took 9565.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -163.0 MB). Peak memory consumption was 577.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:21:11,668 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:21:11,668 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:21:11,669 INFO L168 Benchmark]: Boogie Preprocessor took 127.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:21:11,670 INFO L168 Benchmark]: RCFGBuilder took 1339.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:21:11,671 INFO L168 Benchmark]: TraceAbstraction took 7302.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 529.8 MB). Peak memory consumption was 529.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:21:11,675 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.44 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.43 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1339.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.5 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7302.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 529.8 MB). Peak memory consumption was 529.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ~bvadd64(len, 4294967294bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32 - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ~bvadd64(len, 4294967294bv32) == 0bv32 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 70 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 73 SDslu, 382 SDs, 0 SdLazy, 90 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 41 PreInvPairs, 50 NumberOfFragments, 43 HoareAnnotationTreeSize, 41 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 12852 SizeOfPredicates, 8 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 12/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...