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/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:20:01,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:20:01,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:20:01,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:20:01,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:20:01,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:20:01,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:20:01,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:20:01,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:20:01,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:20:01,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:20:01,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:20:01,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:20:01,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:20:01,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:20:01,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:20:01,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:20:01,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:20:01,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:20:01,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:20:01,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:20:01,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:20:01,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:20:01,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:20:01,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:20:01,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:20:01,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:20:01,518 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:20:01,519 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:20:01,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:20:01,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:20:01,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:20:01,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:20:01,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:20:01,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:20:01,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:20:01,527 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:20:01,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:20:01,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:20:01,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:20:01,544 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:20:01,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:20:01,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:20:01,545 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:20:01,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:20:01,545 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:20:01,545 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:20:01,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:20:01,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:20:01,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:20:01,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:20:01,546 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:20:01,547 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:20:01,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:20:01,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:20:01,547 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:20:01,547 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:20:01,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:20:01,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:20:01,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:20:01,548 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:20:01,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:20:01,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:20:01,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:20:01,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:20:01,549 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:20:01,549 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:20:01,549 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:20:01,550 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:20:01,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:20:01,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:20:01,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:20:01,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:20:01,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:20:01,624 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:20:01,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:20:01,687 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d535b8209/0b7d5ae4e38b41b2877041b37c8f4c98/FLAG7cac633f6 [2018-11-14 18:20:02,283 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:20:02,284 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:20:02,305 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d535b8209/0b7d5ae4e38b41b2877041b37c8f4c98/FLAG7cac633f6 [2018-11-14 18:20:02,320 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d535b8209/0b7d5ae4e38b41b2877041b37c8f4c98 [2018-11-14 18:20:02,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:20:02,331 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:20:02,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:20:02,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:20:02,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:20:02,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:20:02" (1/1) ... [2018-11-14 18:20:02,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc86cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:02, skipping insertion in model container [2018-11-14 18:20:02,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:20:02" (1/1) ... [2018-11-14 18:20:02,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:20:02,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:20:02,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:20:02,850 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:20:02,941 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:20:03,093 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:20:03,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03 WrapperNode [2018-11-14 18:20:03,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:20:03,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:20:03,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:20:03,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:20:03,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (1/1) ... [2018-11-14 18:20:03,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:20:03,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:20:03,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:20:03,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:20:03,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (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:20:03,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:20:03,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:20:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:20:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:20:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:20:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 18:20:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 18:20:03,264 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-14 18:20:03,265 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-14 18:20:03,265 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-14 18:20:03,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:20:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:20:03,265 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:20:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:20:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:20:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:20:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:20:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:20:03,266 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:20:03,267 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:20:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:20:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:20:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:20:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:20:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:20:03,268 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:20:03,269 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:20:03,270 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:20:03,271 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:20:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:20:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:20:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:20:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:20:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:20:03,272 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:20:03,273 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:20:03,274 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:20:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:20:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:20:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:20:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:20:03,275 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:20:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:20:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:20:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:20:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:20:03,276 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:20:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:20:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:20:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:20:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:20:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:20:03,277 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:20:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:20:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:20:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:20:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:20:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:20:03,278 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:20:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:20:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:20:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:20:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:20:03,279 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:20:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:20:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:20:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:20:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:20:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:20:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:20:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:20:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:20:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:20:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:20:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:20:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:20:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:20:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:20:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:20:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:20:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:20:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 18:20:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:20:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:20:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:20:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 18:20:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-14 18:20:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:20:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:20:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-14 18:20:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:20:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-14 18:20:03,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:20:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:20:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:20:03,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:20:04,725 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:20:04,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:20:04 BoogieIcfgContainer [2018-11-14 18:20:04,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:20:04,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:20:04,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:20:04,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:20:04,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:20:02" (1/3) ... [2018-11-14 18:20:04,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213e9158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:20:04, skipping insertion in model container [2018-11-14 18:20:04,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:20:03" (2/3) ... [2018-11-14 18:20:04,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213e9158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:20:04, skipping insertion in model container [2018-11-14 18:20:04,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:20:04" (3/3) ... [2018-11-14 18:20:04,738 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:20:04,750 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:20:04,763 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:20:04,782 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:20:04,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:20:04,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:20:04,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:20:04,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:20:04,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:20:04,823 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:20:04,823 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:20:04,823 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:20:04,824 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:20:04,849 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-14 18:20:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:20:04,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:04,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:04,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:04,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:04,868 INFO L82 PathProgramCache]: Analyzing trace with hash -550103463, now seen corresponding path program 1 times [2018-11-14 18:20:04,873 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:04,874 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:20:04,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:20:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:05,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:05,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-14 18:20:05,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {68#true} is VALID [2018-11-14 18:20:05,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-14 18:20:05,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #163#return; {68#true} is VALID [2018-11-14 18:20:05,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret17 := main(); {68#true} is VALID [2018-11-14 18:20:05,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {68#true} ~len~0 := 2bv32;~data~0 := 1bv32; {68#true} is VALID [2018-11-14 18:20:05,693 INFO L256 TraceCheckUtils]: 6: Hoare triple {68#true} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {68#true} is VALID [2018-11-14 18:20:05,693 INFO L273 TraceCheckUtils]: 7: Hoare triple {68#true} ~len := #in~len;~data := #in~data; {68#true} is VALID [2018-11-14 18:20:05,693 INFO L256 TraceCheckUtils]: 8: Hoare triple {68#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {68#true} is VALID [2018-11-14 18:20:05,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {68#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {68#true} is VALID [2018-11-14 18:20:05,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {68#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {68#true} is VALID [2018-11-14 18:20:05,694 INFO L273 TraceCheckUtils]: 11: Hoare triple {68#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {68#true} is VALID [2018-11-14 18:20:05,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-14 18:20:05,695 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {68#true} {68#true} #149#return; {68#true} is VALID [2018-11-14 18:20:05,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {68#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {68#true} is VALID [2018-11-14 18:20:05,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {68#true} assume !true; {69#false} is VALID [2018-11-14 18:20:05,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {69#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {69#false} is VALID [2018-11-14 18:20:05,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-14 18:20:05,697 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {69#false} {68#true} #155#return; {69#false} is VALID [2018-11-14 18:20:05,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {69#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {69#false} is VALID [2018-11-14 18:20:05,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 18:20:05,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {69#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {69#false} is VALID [2018-11-14 18:20:05,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-14 18:20:05,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {69#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {69#false} is VALID [2018-11-14 18:20:05,699 INFO L256 TraceCheckUtils]: 24: Hoare triple {69#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {69#false} is VALID [2018-11-14 18:20:05,699 INFO L273 TraceCheckUtils]: 25: Hoare triple {69#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {69#false} is VALID [2018-11-14 18:20:05,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 18:20:05,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {69#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {69#false} is VALID [2018-11-14 18:20:05,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {69#false} assume true; {69#false} is VALID [2018-11-14 18:20:05,700 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {69#false} {69#false} #159#return; {69#false} is VALID [2018-11-14 18:20:05,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {69#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {69#false} is VALID [2018-11-14 18:20:05,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-14 18:20:05,707 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:20:05,708 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:20:05,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:20:05,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:20:05,720 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:20:05,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:20:05,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:20:05,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:05,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:20:05,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:20:05,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:20:05,865 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-11-14 18:20:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:06,529 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2018-11-14 18:20:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:20:06,529 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:20:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:20:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:20:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2018-11-14 18:20:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:20:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2018-11-14 18:20:06,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 135 transitions. [2018-11-14 18:20:06,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:06,961 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:20:06,962 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:20:06,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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:20:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:20:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-14 18:20:07,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:20:07,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-14 18:20:07,050 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 18:20:07,051 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 18:20:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:07,058 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:20:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:20:07,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:07,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:07,060 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-14 18:20:07,060 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-14 18:20:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:07,066 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 18:20:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:20:07,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:07,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:07,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:20:07,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:20:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 18:20:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-11-14 18:20:07,074 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 32 [2018-11-14 18:20:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:20:07,075 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-11-14 18:20:07,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:20:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 18:20:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:20:07,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:07,078 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:07,078 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:07,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1655037061, now seen corresponding path program 1 times [2018-11-14 18:20:07,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:07,080 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:20:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:20:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:07,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:07,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {473#true} call ULTIMATE.init(); {473#true} is VALID [2018-11-14 18:20:07,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {473#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {473#true} is VALID [2018-11-14 18:20:07,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {473#true} assume true; {473#true} is VALID [2018-11-14 18:20:07,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {473#true} {473#true} #163#return; {473#true} is VALID [2018-11-14 18:20:07,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {473#true} call #t~ret17 := main(); {473#true} is VALID [2018-11-14 18:20:07,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#true} ~len~0 := 2bv32;~data~0 := 1bv32; {493#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:07,566 INFO L256 TraceCheckUtils]: 6: Hoare triple {493#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {473#true} is VALID [2018-11-14 18:20:07,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {473#true} ~len := #in~len;~data := #in~data; {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:20:07,574 INFO L256 TraceCheckUtils]: 8: Hoare triple {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {473#true} is VALID [2018-11-14 18:20:07,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {473#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {473#true} is VALID [2018-11-14 18:20:07,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {473#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {473#true} is VALID [2018-11-14 18:20:07,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {473#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {473#true} is VALID [2018-11-14 18:20:07,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {473#true} assume true; {473#true} is VALID [2018-11-14 18:20:07,576 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {473#true} {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #149#return; {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:20:07,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:20:07,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 18:20:07,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {500#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {528#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:20:07,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {528#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {528#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:20:07,615 INFO L273 TraceCheckUtils]: 18: Hoare triple {528#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {528#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:20:07,617 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {528#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {493#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #155#return; {474#false} is VALID [2018-11-14 18:20:07,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {474#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {474#false} is VALID [2018-11-14 18:20:07,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {474#false} assume true; {474#false} is VALID [2018-11-14 18:20:07,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {474#false} assume !~bvsgt32(~i~0, 4294967295bv32); {474#false} is VALID [2018-11-14 18:20:07,618 INFO L273 TraceCheckUtils]: 23: Hoare triple {474#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {474#false} is VALID [2018-11-14 18:20:07,618 INFO L273 TraceCheckUtils]: 24: Hoare triple {474#false} assume true; {474#false} is VALID [2018-11-14 18:20:07,618 INFO L273 TraceCheckUtils]: 25: Hoare triple {474#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {474#false} is VALID [2018-11-14 18:20:07,619 INFO L256 TraceCheckUtils]: 26: Hoare triple {474#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {474#false} is VALID [2018-11-14 18:20:07,619 INFO L273 TraceCheckUtils]: 27: Hoare triple {474#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {474#false} is VALID [2018-11-14 18:20:07,619 INFO L273 TraceCheckUtils]: 28: Hoare triple {474#false} assume true; {474#false} is VALID [2018-11-14 18:20:07,619 INFO L273 TraceCheckUtils]: 29: Hoare triple {474#false} assume !~bvsgt32(~index, 0bv32); {474#false} is VALID [2018-11-14 18:20:07,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {474#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {474#false} is VALID [2018-11-14 18:20:07,620 INFO L273 TraceCheckUtils]: 31: Hoare triple {474#false} assume true; {474#false} is VALID [2018-11-14 18:20:07,621 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {474#false} {474#false} #159#return; {474#false} is VALID [2018-11-14 18:20:07,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {474#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {474#false} is VALID [2018-11-14 18:20:07,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {474#false} assume !false; {474#false} is VALID [2018-11-14 18:20:07,624 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:20:07,625 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:20:07,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:20:07,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:20:07,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 18:20:07,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:20:07,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:20:07,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:07,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:20:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:20:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:20:07,832 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 5 states. [2018-11-14 18:20:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:08,598 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-14 18:20:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:20:08,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 18:20:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:20:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:20:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-14 18:20:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:20:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2018-11-14 18:20:08,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 95 transitions. [2018-11-14 18:20:08,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:08,800 INFO L225 Difference]: With dead ends: 83 [2018-11-14 18:20:08,801 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 18:20:08,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:20:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 18:20:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-14 18:20:08,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:20:08,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 51 states. [2018-11-14 18:20:08,857 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 51 states. [2018-11-14 18:20:08,857 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 51 states. [2018-11-14 18:20:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:08,864 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-14 18:20:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-14 18:20:08,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:08,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:08,866 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 55 states. [2018-11-14 18:20:08,866 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 55 states. [2018-11-14 18:20:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:08,873 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-14 18:20:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-14 18:20:08,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:08,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:08,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:20:08,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:20:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 18:20:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-14 18:20:08,883 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 35 [2018-11-14 18:20:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:20:08,883 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-14 18:20:08,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:20:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-14 18:20:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:20:08,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:08,886 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:08,886 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:08,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash -727505177, now seen corresponding path program 1 times [2018-11-14 18:20:08,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:08,887 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:20:08,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:20:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:09,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:09,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {878#true} call ULTIMATE.init(); {878#true} is VALID [2018-11-14 18:20:09,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {878#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {878#true} is VALID [2018-11-14 18:20:09,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:20:09,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {878#true} {878#true} #163#return; {878#true} is VALID [2018-11-14 18:20:09,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {878#true} call #t~ret17 := main(); {878#true} is VALID [2018-11-14 18:20:09,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {878#true} ~len~0 := 2bv32;~data~0 := 1bv32; {898#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:09,126 INFO L256 TraceCheckUtils]: 6: Hoare triple {898#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {878#true} is VALID [2018-11-14 18:20:09,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {878#true} ~len := #in~len;~data := #in~data; {878#true} is VALID [2018-11-14 18:20:09,126 INFO L256 TraceCheckUtils]: 8: Hoare triple {878#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {878#true} is VALID [2018-11-14 18:20:09,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {878#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {878#true} is VALID [2018-11-14 18:20:09,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {878#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {878#true} is VALID [2018-11-14 18:20:09,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {878#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {878#true} is VALID [2018-11-14 18:20:09,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:20:09,128 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {878#true} {878#true} #149#return; {878#true} is VALID [2018-11-14 18:20:09,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {878#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {878#true} is VALID [2018-11-14 18:20:09,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:20:09,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {878#true} assume !!~bvsgt32(~len, 1bv32); {878#true} is VALID [2018-11-14 18:20:09,129 INFO L256 TraceCheckUtils]: 17: Hoare triple {878#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {878#true} is VALID [2018-11-14 18:20:09,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {878#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {878#true} is VALID [2018-11-14 18:20:09,129 INFO L273 TraceCheckUtils]: 19: Hoare triple {878#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {878#true} is VALID [2018-11-14 18:20:09,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {878#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {878#true} is VALID [2018-11-14 18:20:09,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:20:09,130 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {878#true} {878#true} #151#return; {878#true} is VALID [2018-11-14 18:20:09,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {878#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {878#true} is VALID [2018-11-14 18:20:09,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {878#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(4bv32, ~head~0.offset), 4bv32); {878#true} is VALID [2018-11-14 18:20:09,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {878#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {878#true} is VALID [2018-11-14 18:20:09,131 INFO L273 TraceCheckUtils]: 26: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:20:09,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {878#true} assume !~bvsgt32(~len, 1bv32); {878#true} is VALID [2018-11-14 18:20:09,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {878#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {878#true} is VALID [2018-11-14 18:20:09,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {878#true} assume true; {878#true} is VALID [2018-11-14 18:20:09,133 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {878#true} {898#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #155#return; {898#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:09,135 INFO L273 TraceCheckUtils]: 31: Hoare triple {898#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {977#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:09,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {977#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {977#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:09,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {977#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {879#false} is VALID [2018-11-14 18:20:09,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {879#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {879#false} is VALID [2018-11-14 18:20:09,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {879#false} assume true; {879#false} is VALID [2018-11-14 18:20:09,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {879#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {879#false} is VALID [2018-11-14 18:20:09,138 INFO L256 TraceCheckUtils]: 37: Hoare triple {879#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {879#false} is VALID [2018-11-14 18:20:09,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {879#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {879#false} is VALID [2018-11-14 18:20:09,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {879#false} assume true; {879#false} is VALID [2018-11-14 18:20:09,140 INFO L273 TraceCheckUtils]: 40: Hoare triple {879#false} assume !~bvsgt32(~index, 0bv32); {879#false} is VALID [2018-11-14 18:20:09,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {879#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {879#false} is VALID [2018-11-14 18:20:09,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {879#false} assume true; {879#false} is VALID [2018-11-14 18:20:09,141 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {879#false} {879#false} #159#return; {879#false} is VALID [2018-11-14 18:20:09,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {879#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {879#false} is VALID [2018-11-14 18:20:09,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {879#false} assume !false; {879#false} is VALID [2018-11-14 18:20:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:20:09,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:20:09,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:20:09,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:20:09,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-14 18:20:09,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:20:09,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:20:09,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:09,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:20:09,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:20:09,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:20:09,219 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-11-14 18:20:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:09,777 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-11-14 18:20:09,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:20:09,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-11-14 18:20:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:20:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:20:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-14 18:20:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:20:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2018-11-14 18:20:09,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2018-11-14 18:20:09,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:09,943 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:20:09,944 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:20:09,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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:20:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:20:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-11-14 18:20:10,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:20:10,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 53 states. [2018-11-14 18:20:10,016 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 53 states. [2018-11-14 18:20:10,016 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 53 states. [2018-11-14 18:20:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:10,020 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 18:20:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-14 18:20:10,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:10,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:10,021 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 62 states. [2018-11-14 18:20:10,021 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 62 states. [2018-11-14 18:20:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:10,026 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-14 18:20:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-14 18:20:10,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:10,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:10,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:20:10,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:20:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:20:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-14 18:20:10,031 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 46 [2018-11-14 18:20:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:20:10,032 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-14 18:20:10,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:20:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 18:20:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 18:20:10,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:10,034 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:10,034 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:10,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash 433880622, now seen corresponding path program 1 times [2018-11-14 18:20:10,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:10,035 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:20:10,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:20:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:10,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:10,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-14 18:20:10,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1325#true} is VALID [2018-11-14 18:20:10,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-14 18:20:10,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #163#return; {1325#true} is VALID [2018-11-14 18:20:10,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret17 := main(); {1325#true} is VALID [2018-11-14 18:20:10,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1345#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:10,392 INFO L256 TraceCheckUtils]: 6: Hoare triple {1345#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1325#true} is VALID [2018-11-14 18:20:10,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {1325#true} ~len := #in~len;~data := #in~data; {1325#true} is VALID [2018-11-14 18:20:10,392 INFO L256 TraceCheckUtils]: 8: Hoare triple {1325#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1325#true} is VALID [2018-11-14 18:20:10,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1325#true} is VALID [2018-11-14 18:20:10,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {1325#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1325#true} is VALID [2018-11-14 18:20:10,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {1325#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1325#true} is VALID [2018-11-14 18:20:10,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-14 18:20:10,394 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1325#true} {1325#true} #149#return; {1325#true} is VALID [2018-11-14 18:20:10,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1325#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1325#true} is VALID [2018-11-14 18:20:10,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-14 18:20:10,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {1325#true} assume !!~bvsgt32(~len, 1bv32); {1325#true} is VALID [2018-11-14 18:20:10,395 INFO L256 TraceCheckUtils]: 17: Hoare triple {1325#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1325#true} is VALID [2018-11-14 18:20:10,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1325#true} is VALID [2018-11-14 18:20:10,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {1325#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1325#true} is VALID [2018-11-14 18:20:10,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {1325#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1325#true} is VALID [2018-11-14 18:20:10,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-14 18:20:10,397 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1325#true} #151#return; {1325#true} is VALID [2018-11-14 18:20:10,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {1325#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1325#true} is VALID [2018-11-14 18:20:10,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {1325#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(4bv32, ~head~0.offset), 4bv32); {1325#true} is VALID [2018-11-14 18:20:10,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {1325#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1325#true} is VALID [2018-11-14 18:20:10,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-14 18:20:10,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {1325#true} assume !~bvsgt32(~len, 1bv32); {1325#true} is VALID [2018-11-14 18:20:10,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {1325#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1325#true} is VALID [2018-11-14 18:20:10,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-14 18:20:10,409 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1325#true} {1345#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #155#return; {1345#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:10,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {1345#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:10,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:10,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:10,417 INFO L256 TraceCheckUtils]: 34: Hoare triple {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1325#true} is VALID [2018-11-14 18:20:10,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {1325#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1437#(= dll_circular_update_at_~index |dll_circular_update_at_#in~index|)} is VALID [2018-11-14 18:20:10,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {1437#(= dll_circular_update_at_~index |dll_circular_update_at_#in~index|)} assume true; {1437#(= dll_circular_update_at_~index |dll_circular_update_at_#in~index|)} is VALID [2018-11-14 18:20:10,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {1437#(= dll_circular_update_at_~index |dll_circular_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {1444#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-14 18:20:10,437 INFO L273 TraceCheckUtils]: 38: Hoare triple {1444#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1444#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-14 18:20:10,438 INFO L273 TraceCheckUtils]: 39: Hoare triple {1444#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {1444#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-14 18:20:10,439 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1444#(not (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))} {1424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #157#return; {1326#false} is VALID [2018-11-14 18:20:10,439 INFO L273 TraceCheckUtils]: 41: Hoare triple {1326#false} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1326#false} is VALID [2018-11-14 18:20:10,439 INFO L273 TraceCheckUtils]: 42: Hoare triple {1326#false} assume true; {1326#false} is VALID [2018-11-14 18:20:10,440 INFO L273 TraceCheckUtils]: 43: Hoare triple {1326#false} assume !~bvsgt32(~i~0, 4294967295bv32); {1326#false} is VALID [2018-11-14 18:20:10,440 INFO L273 TraceCheckUtils]: 44: Hoare triple {1326#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1326#false} is VALID [2018-11-14 18:20:10,440 INFO L273 TraceCheckUtils]: 45: Hoare triple {1326#false} assume true; {1326#false} is VALID [2018-11-14 18:20:10,440 INFO L273 TraceCheckUtils]: 46: Hoare triple {1326#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1326#false} is VALID [2018-11-14 18:20:10,440 INFO L256 TraceCheckUtils]: 47: Hoare triple {1326#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1326#false} is VALID [2018-11-14 18:20:10,441 INFO L273 TraceCheckUtils]: 48: Hoare triple {1326#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1326#false} is VALID [2018-11-14 18:20:10,441 INFO L273 TraceCheckUtils]: 49: Hoare triple {1326#false} assume true; {1326#false} is VALID [2018-11-14 18:20:10,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {1326#false} assume !~bvsgt32(~index, 0bv32); {1326#false} is VALID [2018-11-14 18:20:10,442 INFO L273 TraceCheckUtils]: 51: Hoare triple {1326#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1326#false} is VALID [2018-11-14 18:20:10,442 INFO L273 TraceCheckUtils]: 52: Hoare triple {1326#false} assume true; {1326#false} is VALID [2018-11-14 18:20:10,442 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1326#false} {1326#false} #159#return; {1326#false} is VALID [2018-11-14 18:20:10,443 INFO L273 TraceCheckUtils]: 54: Hoare triple {1326#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1326#false} is VALID [2018-11-14 18:20:10,443 INFO L273 TraceCheckUtils]: 55: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-14 18:20:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:20:10,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:20:10,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:20:10,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:20:10,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-14 18:20:10,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:20:10,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:20:10,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:10,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:20:10,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:20:10,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:20:10,542 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-11-14 18:20:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:11,311 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-14 18:20:11,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:20:11,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-14 18:20:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:20:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:20:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-14 18:20:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:20:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2018-11-14 18:20:11,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 102 transitions. [2018-11-14 18:20:11,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:11,483 INFO L225 Difference]: With dead ends: 91 [2018-11-14 18:20:11,483 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 18:20:11,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:20:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 18:20:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2018-11-14 18:20:11,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:20:11,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 59 states. [2018-11-14 18:20:11,584 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 59 states. [2018-11-14 18:20:11,584 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 59 states. [2018-11-14 18:20:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:11,589 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-14 18:20:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-14 18:20:11,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:11,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:11,590 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 67 states. [2018-11-14 18:20:11,590 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 67 states. [2018-11-14 18:20:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:11,595 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-14 18:20:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-14 18:20:11,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:11,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:11,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:20:11,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:20:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:20:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-14 18:20:11,600 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 56 [2018-11-14 18:20:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:20:11,601 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-14 18:20:11,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:20:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2018-11-14 18:20:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:20:11,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:11,603 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:11,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:11,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1203676844, now seen corresponding path program 1 times [2018-11-14 18:20:11,604 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:11,604 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:20:11,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:20:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:11,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:11,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {1844#true} call ULTIMATE.init(); {1844#true} is VALID [2018-11-14 18:20:11,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {1844#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1844#true} is VALID [2018-11-14 18:20:11,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:11,998 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1844#true} {1844#true} #163#return; {1844#true} is VALID [2018-11-14 18:20:11,998 INFO L256 TraceCheckUtils]: 4: Hoare triple {1844#true} call #t~ret17 := main(); {1844#true} is VALID [2018-11-14 18:20:11,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {1844#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1864#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:11,999 INFO L256 TraceCheckUtils]: 6: Hoare triple {1864#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1844#true} is VALID [2018-11-14 18:20:11,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {1844#true} ~len := #in~len;~data := #in~data; {1844#true} is VALID [2018-11-14 18:20:11,999 INFO L256 TraceCheckUtils]: 8: Hoare triple {1844#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1844#true} is VALID [2018-11-14 18:20:12,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {1844#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1844#true} is VALID [2018-11-14 18:20:12,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {1844#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1844#true} is VALID [2018-11-14 18:20:12,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {1844#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,000 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1844#true} {1844#true} #149#return; {1844#true} is VALID [2018-11-14 18:20:12,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {1844#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {1844#true} assume !!~bvsgt32(~len, 1bv32); {1844#true} is VALID [2018-11-14 18:20:12,001 INFO L256 TraceCheckUtils]: 17: Hoare triple {1844#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1844#true} is VALID [2018-11-14 18:20:12,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {1844#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1844#true} is VALID [2018-11-14 18:20:12,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {1844#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1844#true} is VALID [2018-11-14 18:20:12,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {1844#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,003 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1844#true} {1844#true} #151#return; {1844#true} is VALID [2018-11-14 18:20:12,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {1844#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1844#true} is VALID [2018-11-14 18:20:12,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {1844#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(4bv32, ~head~0.offset), 4bv32); {1844#true} is VALID [2018-11-14 18:20:12,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {1844#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1844#true} is VALID [2018-11-14 18:20:12,004 INFO L273 TraceCheckUtils]: 26: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {1844#true} assume !~bvsgt32(~len, 1bv32); {1844#true} is VALID [2018-11-14 18:20:12,005 INFO L273 TraceCheckUtils]: 28: Hoare triple {1844#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,038 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1844#true} {1864#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #155#return; {1864#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:12,042 INFO L273 TraceCheckUtils]: 31: Hoare triple {1864#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:12,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:12,050 INFO L273 TraceCheckUtils]: 33: Hoare triple {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:12,050 INFO L256 TraceCheckUtils]: 34: Hoare triple {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1844#true} is VALID [2018-11-14 18:20:12,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {1844#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1844#true} is VALID [2018-11-14 18:20:12,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {1844#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1844#true} is VALID [2018-11-14 18:20:12,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,051 INFO L273 TraceCheckUtils]: 39: Hoare triple {1844#true} assume !~bvsgt32(~index, 0bv32); {1844#true} is VALID [2018-11-14 18:20:12,051 INFO L273 TraceCheckUtils]: 40: Hoare triple {1844#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1844#true} is VALID [2018-11-14 18:20:12,052 INFO L273 TraceCheckUtils]: 41: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,053 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1844#true} {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #157#return; {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:12,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {1943#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {1980#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:20:12,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {1980#(= main_~i~0 (_ bv0 32))} assume true; {1980#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:20:12,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {1980#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1845#false} is VALID [2018-11-14 18:20:12,055 INFO L273 TraceCheckUtils]: 46: Hoare triple {1845#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1845#false} is VALID [2018-11-14 18:20:12,056 INFO L273 TraceCheckUtils]: 47: Hoare triple {1845#false} assume true; {1845#false} is VALID [2018-11-14 18:20:12,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {1845#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1845#false} is VALID [2018-11-14 18:20:12,057 INFO L256 TraceCheckUtils]: 49: Hoare triple {1845#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1845#false} is VALID [2018-11-14 18:20:12,057 INFO L273 TraceCheckUtils]: 50: Hoare triple {1845#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1845#false} is VALID [2018-11-14 18:20:12,057 INFO L273 TraceCheckUtils]: 51: Hoare triple {1845#false} assume true; {1845#false} is VALID [2018-11-14 18:20:12,058 INFO L273 TraceCheckUtils]: 52: Hoare triple {1845#false} assume !~bvsgt32(~index, 0bv32); {1845#false} is VALID [2018-11-14 18:20:12,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {1845#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1845#false} is VALID [2018-11-14 18:20:12,058 INFO L273 TraceCheckUtils]: 54: Hoare triple {1845#false} assume true; {1845#false} is VALID [2018-11-14 18:20:12,058 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1845#false} {1845#false} #159#return; {1845#false} is VALID [2018-11-14 18:20:12,059 INFO L273 TraceCheckUtils]: 56: Hoare triple {1845#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1845#false} is VALID [2018-11-14 18:20:12,059 INFO L273 TraceCheckUtils]: 57: Hoare triple {1845#false} assume !false; {1845#false} is VALID [2018-11-14 18:20:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 18:20:12,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:20:12,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {1845#false} assume !false; {1845#false} is VALID [2018-11-14 18:20:12,347 INFO L273 TraceCheckUtils]: 56: Hoare triple {1845#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1845#false} is VALID [2018-11-14 18:20:12,347 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1844#true} {1845#false} #159#return; {1845#false} is VALID [2018-11-14 18:20:12,348 INFO L273 TraceCheckUtils]: 54: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {1844#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1844#true} is VALID [2018-11-14 18:20:12,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {1844#true} assume !~bvsgt32(~index, 0bv32); {1844#true} is VALID [2018-11-14 18:20:12,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {1844#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1844#true} is VALID [2018-11-14 18:20:12,349 INFO L256 TraceCheckUtils]: 49: Hoare triple {1845#false} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1844#true} is VALID [2018-11-14 18:20:12,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {1845#false} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {1845#false} is VALID [2018-11-14 18:20:12,349 INFO L273 TraceCheckUtils]: 47: Hoare triple {1845#false} assume true; {1845#false} is VALID [2018-11-14 18:20:12,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {1845#false} ~i~0 := ~bvsub32(~len~0, 1bv32); {1845#false} is VALID [2018-11-14 18:20:12,350 INFO L273 TraceCheckUtils]: 45: Hoare triple {2059#(bvsgt main_~i~0 (_ bv4294967295 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {1845#false} is VALID [2018-11-14 18:20:12,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {2059#(bvsgt main_~i~0 (_ bv4294967295 32))} assume true; {2059#(bvsgt main_~i~0 (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2059#(bvsgt main_~i~0 (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,352 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1844#true} {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} #157#return; {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,352 INFO L273 TraceCheckUtils]: 40: Hoare triple {1844#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {1844#true} is VALID [2018-11-14 18:20:12,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {1844#true} assume !~bvsgt32(~index, 0bv32); {1844#true} is VALID [2018-11-14 18:20:12,353 INFO L273 TraceCheckUtils]: 38: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {1844#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {1844#true} is VALID [2018-11-14 18:20:12,353 INFO L273 TraceCheckUtils]: 36: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,354 INFO L273 TraceCheckUtils]: 35: Hoare triple {1844#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1844#true} is VALID [2018-11-14 18:20:12,354 INFO L256 TraceCheckUtils]: 34: Hoare triple {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1844#true} is VALID [2018-11-14 18:20:12,355 INFO L273 TraceCheckUtils]: 33: Hoare triple {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,355 INFO L273 TraceCheckUtils]: 32: Hoare triple {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} assume true; {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {2103#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {2066#(bvsgt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,365 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1844#true} {2103#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} #155#return; {2103#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {1844#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {1844#true} assume !~bvsgt32(~len, 1bv32); {1844#true} is VALID [2018-11-14 18:20:12,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,366 INFO L273 TraceCheckUtils]: 25: Hoare triple {1844#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1844#true} is VALID [2018-11-14 18:20:12,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {1844#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(4bv32, ~head~0.offset), 4bv32); {1844#true} is VALID [2018-11-14 18:20:12,367 INFO L273 TraceCheckUtils]: 23: Hoare triple {1844#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {1844#true} is VALID [2018-11-14 18:20:12,367 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1844#true} {1844#true} #151#return; {1844#true} is VALID [2018-11-14 18:20:12,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {1844#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {1844#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1844#true} is VALID [2018-11-14 18:20:12,368 INFO L273 TraceCheckUtils]: 18: Hoare triple {1844#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1844#true} is VALID [2018-11-14 18:20:12,368 INFO L256 TraceCheckUtils]: 17: Hoare triple {1844#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1844#true} is VALID [2018-11-14 18:20:12,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {1844#true} assume !!~bvsgt32(~len, 1bv32); {1844#true} is VALID [2018-11-14 18:20:12,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,369 INFO L273 TraceCheckUtils]: 14: Hoare triple {1844#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,370 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1844#true} {1844#true} #149#return; {1844#true} is VALID [2018-11-14 18:20:12,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {1844#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1844#true} is VALID [2018-11-14 18:20:12,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {1844#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1844#true} is VALID [2018-11-14 18:20:12,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {1844#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1844#true} is VALID [2018-11-14 18:20:12,371 INFO L256 TraceCheckUtils]: 8: Hoare triple {1844#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1844#true} is VALID [2018-11-14 18:20:12,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {1844#true} ~len := #in~len;~data := #in~data; {1844#true} is VALID [2018-11-14 18:20:12,371 INFO L256 TraceCheckUtils]: 6: Hoare triple {2103#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {1844#true} is VALID [2018-11-14 18:20:12,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {1844#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2103#(bvsgt (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv4294967295 32))} is VALID [2018-11-14 18:20:12,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {1844#true} call #t~ret17 := main(); {1844#true} is VALID [2018-11-14 18:20:12,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1844#true} {1844#true} #163#return; {1844#true} is VALID [2018-11-14 18:20:12,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {1844#true} assume true; {1844#true} is VALID [2018-11-14 18:20:12,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {1844#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1844#true} is VALID [2018-11-14 18:20:12,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {1844#true} call ULTIMATE.init(); {1844#true} is VALID [2018-11-14 18:20:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 18:20:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:20:12,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 18:20:12,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:20:12,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:20:12,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:20:12,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:12,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:20:12,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:20:12,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:20:12,496 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 8 states. [2018-11-14 18:20:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:13,834 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2018-11-14 18:20:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:20:13,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:20:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:20:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:20:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-14 18:20:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:20:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-14 18:20:13,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2018-11-14 18:20:14,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:14,132 INFO L225 Difference]: With dead ends: 92 [2018-11-14 18:20:14,132 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:20:14,133 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:20:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:20:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-11-14 18:20:14,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:20:14,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 62 states. [2018-11-14 18:20:14,171 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 62 states. [2018-11-14 18:20:14,171 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 62 states. [2018-11-14 18:20:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:14,176 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-11-14 18:20:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-11-14 18:20:14,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:14,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:14,177 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 78 states. [2018-11-14 18:20:14,177 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 78 states. [2018-11-14 18:20:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:14,181 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-11-14 18:20:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-11-14 18:20:14,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:14,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:14,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:20:14,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:20:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:20:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-11-14 18:20:14,185 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 58 [2018-11-14 18:20:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:20:14,186 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-14 18:20:14,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:20:14,186 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-14 18:20:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-14 18:20:14,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:14,187 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:14,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:14,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:14,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1606136741, now seen corresponding path program 2 times [2018-11-14 18:20:14,188 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:14,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:20:14,210 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:20:14,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:20:14,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:20:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:14,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:14,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {2575#true} call ULTIMATE.init(); {2575#true} is VALID [2018-11-14 18:20:14,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {2575#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2575#true} is VALID [2018-11-14 18:20:14,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2575#true} {2575#true} #163#return; {2575#true} is VALID [2018-11-14 18:20:14,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {2575#true} call #t~ret17 := main(); {2575#true} is VALID [2018-11-14 18:20:14,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {2575#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,460 INFO L256 TraceCheckUtils]: 6: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := dll_circular_create(~len~0, ~data~0); {2575#true} is VALID [2018-11-14 18:20:14,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {2575#true} ~len := #in~len;~data := #in~data; {2575#true} is VALID [2018-11-14 18:20:14,460 INFO L256 TraceCheckUtils]: 8: Hoare triple {2575#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2575#true} is VALID [2018-11-14 18:20:14,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {2575#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2575#true} is VALID [2018-11-14 18:20:14,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {2575#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2575#true} is VALID [2018-11-14 18:20:14,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {2575#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2575#true} is VALID [2018-11-14 18:20:14,461 INFO L273 TraceCheckUtils]: 12: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,461 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2575#true} {2575#true} #149#return; {2575#true} is VALID [2018-11-14 18:20:14,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {2575#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2575#true} is VALID [2018-11-14 18:20:14,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {2575#true} assume !!~bvsgt32(~len, 1bv32); {2575#true} is VALID [2018-11-14 18:20:14,462 INFO L256 TraceCheckUtils]: 17: Hoare triple {2575#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2575#true} is VALID [2018-11-14 18:20:14,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {2575#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2575#true} is VALID [2018-11-14 18:20:14,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {2575#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2575#true} is VALID [2018-11-14 18:20:14,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {2575#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(8bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2575#true} is VALID [2018-11-14 18:20:14,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,463 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2575#true} {2575#true} #151#return; {2575#true} is VALID [2018-11-14 18:20:14,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {2575#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32); {2575#true} is VALID [2018-11-14 18:20:14,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {2575#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(4bv32, ~head~0.offset), 4bv32); {2575#true} is VALID [2018-11-14 18:20:14,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {2575#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2575#true} is VALID [2018-11-14 18:20:14,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {2575#true} assume !~bvsgt32(~len, 1bv32); {2575#true} is VALID [2018-11-14 18:20:14,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {2575#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2575#true} is VALID [2018-11-14 18:20:14,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,465 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2575#true} {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #155#return; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,465 INFO L273 TraceCheckUtils]: 31: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := ~bvsub32(~len~0, 1bv32); {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,466 INFO L256 TraceCheckUtils]: 34: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2575#true} is VALID [2018-11-14 18:20:14,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {2575#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2575#true} is VALID [2018-11-14 18:20:14,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,467 INFO L273 TraceCheckUtils]: 37: Hoare triple {2575#true} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2575#true} is VALID [2018-11-14 18:20:14,467 INFO L273 TraceCheckUtils]: 38: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,467 INFO L273 TraceCheckUtils]: 39: Hoare triple {2575#true} assume !~bvsgt32(~index, 0bv32); {2575#true} is VALID [2018-11-14 18:20:14,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {2575#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {2575#true} is VALID [2018-11-14 18:20:14,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,468 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2575#true} {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #157#return; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,469 INFO L273 TraceCheckUtils]: 43: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,470 INFO L273 TraceCheckUtils]: 44: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,470 INFO L256 TraceCheckUtils]: 46: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call dll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2575#true} is VALID [2018-11-14 18:20:14,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {2575#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2575#true} is VALID [2018-11-14 18:20:14,471 INFO L273 TraceCheckUtils]: 48: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,471 INFO L273 TraceCheckUtils]: 49: Hoare triple {2575#true} assume !~bvsgt32(~index, 0bv32); {2575#true} is VALID [2018-11-14 18:20:14,471 INFO L273 TraceCheckUtils]: 50: Hoare triple {2575#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32); {2575#true} is VALID [2018-11-14 18:20:14,471 INFO L273 TraceCheckUtils]: 51: Hoare triple {2575#true} assume true; {2575#true} is VALID [2018-11-14 18:20:14,473 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2575#true} {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #157#return; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,474 INFO L273 TraceCheckUtils]: 53: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvsub32(#t~post14, 1bv32);havoc #t~post14; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,474 INFO L273 TraceCheckUtils]: 54: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,475 INFO L273 TraceCheckUtils]: 55: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsgt32(~i~0, 4294967295bv32); {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,476 INFO L273 TraceCheckUtils]: 56: Hoare triple {2595#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvsub32(~len~0, 1bv32); {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,477 INFO L273 TraceCheckUtils]: 58: Hoare triple {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvsgt32(~i~0, 4294967295bv32);~expected~0 := ~bvadd32(~i~0, ~len~0); {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:20:14,477 INFO L256 TraceCheckUtils]: 59: Hoare triple {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret16 := dll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2575#true} is VALID [2018-11-14 18:20:14,478 INFO L273 TraceCheckUtils]: 60: Hoare triple {2575#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2762#(= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} is VALID [2018-11-14 18:20:14,478 INFO L273 TraceCheckUtils]: 61: Hoare triple {2762#(= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} assume true; {2762#(= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} is VALID [2018-11-14 18:20:14,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {2762#(= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index)} assume !~bvsgt32(~index, 0bv32); {2769#(not (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-14 18:20:14,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {2769#(not (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32)))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(8bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2769#(not (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-14 18:20:14,480 INFO L273 TraceCheckUtils]: 64: Hoare triple {2769#(not (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32)))} assume true; {2769#(not (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32)))} is VALID [2018-11-14 18:20:14,482 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {2769#(not (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32)))} {2749#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #159#return; {2576#false} is VALID [2018-11-14 18:20:14,482 INFO L273 TraceCheckUtils]: 66: Hoare triple {2576#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2576#false} is VALID [2018-11-14 18:20:14,482 INFO L273 TraceCheckUtils]: 67: Hoare triple {2576#false} assume !false; {2576#false} is VALID [2018-11-14 18:20:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-14 18:20:14,490 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:20:14,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:20:14,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:20:14,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-14 18:20:14,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:20:14,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:20:14,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:14,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:20:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:20:14,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:20:14,581 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-11-14 18:20:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:15,400 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-11-14 18:20:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:20:15,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-14 18:20:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:20:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:20:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-14 18:20:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:20:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-14 18:20:15,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-14 18:20:15,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:20:15,538 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:20:15,538 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:20:15,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:20:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:20:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-14 18:20:15,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:20:15,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 70 states. [2018-11-14 18:20:15,627 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 70 states. [2018-11-14 18:20:15,627 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2018-11-14 18:20:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:15,631 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-14 18:20:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-14 18:20:15,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:15,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:15,632 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 74 states. [2018-11-14 18:20:15,632 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 74 states. [2018-11-14 18:20:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:20:15,636 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-11-14 18:20:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-14 18:20:15,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:20:15,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:20:15,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:20:15,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:20:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:20:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-14 18:20:15,640 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 68 [2018-11-14 18:20:15,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:20:15,641 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-14 18:20:15,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:20:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-14 18:20:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 18:20:15,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:20:15,642 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:20:15,643 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:20:15,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:20:15,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1302226357, now seen corresponding path program 1 times [2018-11-14 18:20:15,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:20:15,643 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:20:15,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:20:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:20:15,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:20:15,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:20:16,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 18:20:16,014 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:20:16,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:20:16,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:20:16,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-14 18:20:16,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-14 18:20:16,308 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:20:16,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:20:16,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:20:16,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-14 18:20:16,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-14 18:20:16,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:20:16,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:16,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:20:16,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-14 18:20:16,559 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:20:17,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2018-11-14 18:20:17,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 18:20:17,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-11-14 18:20:17,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 18:20:17,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-11-14 18:20:17,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-14 18:20:17,355 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-11-14 18:20:17,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:20:17,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 69 [2018-11-14 18:20:17,462 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:20:17,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:20:17,585 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:119, output treesize:72 [2018-11-14 18:20:19,687 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:20:21,796 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-14 18:20:23,975 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-14 18:20:26,467 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 36 [2018-11-14 18:20:26,695 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:20:26,695 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.term(WrapperScript.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.notSimplified(BitvectorUtils.java:263) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplify_NonConstantCase(BitvectorUtils.java:259) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplifiedResult(BitvectorUtils.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils.termWithLocalSimplification(BitvectorUtils.java:180) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.neg(SmtUtils.java:560) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.product(AffineRelation.java:350) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.onLeftHandSideOnly(AffineRelation.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:145) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.derSimple(XnfDer.java:118) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.XnfDer.tryToEliminate(XnfDer.java:97) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.applyEliminationTechniques(QuantifierPusher.java:302) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:215) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPush(QuantifierPusher.java:134) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:107) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$LiveVariablesPostprocessorForward.postprocess(TraceCheckSpWp.java:533) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 18:20:26,701 INFO L168 Benchmark]: Toolchain (without parser) took 24369.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 854.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -483.0 MB). Peak memory consumption was 371.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:20:26,702 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:20:26,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.4 MB). Peak memory consumption was 60.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:20:26,703 INFO L168 Benchmark]: Boogie Preprocessor took 100.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2018-11-14 18:20:26,703 INFO L168 Benchmark]: RCFGBuilder took 1530.92 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. [2018-11-14 18:20:26,704 INFO L168 Benchmark]: TraceAbstraction took 21970.35 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 168.3 MB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 175.5 MB). Peak memory consumption was 343.8 MB. Max. memory is 7.1 GB. [2018-11-14 18:20:26,707 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -743.4 MB). Peak memory consumption was 60.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1530.92 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21970.35 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 168.3 MB). Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 175.5 MB). Peak memory consumption was 343.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...