java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:29:41,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:29:41,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:29:41,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:29:41,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:29:41,788 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:29:41,789 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:29:41,793 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:29:41,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:29:41,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:29:41,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:29:41,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:29:41,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:29:41,800 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:29:41,801 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:29:41,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:29:41,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:29:41,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:29:41,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:29:41,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:29:41,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:29:41,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:29:41,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:29:41,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:29:41,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:29:41,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:29:41,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:29:41,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:29:41,818 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:29:41,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:29:41,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:29:41,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:29:41,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:29:41,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:29:41,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:29:41,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:29:41,823 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:29:41,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:29:41,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:29:41,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:29:41,842 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:29:41,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:29:41,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:29:41,846 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:29:41,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:29:41,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:29:41,847 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:29:41,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:29:41,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:29:41,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:29:41,847 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:29:41,847 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:29:41,848 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:29:41,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:29:41,849 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:29:41,849 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:29:41,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:29:41,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:29:41,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:29:41,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:29:41,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:29:41,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:29:41,850 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:29:41,850 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:29:41,851 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:29:41,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:29:41,851 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:29:41,851 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:29:41,851 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:29:41,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:29:41,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:29:41,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:29:41,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:29:41,938 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:29:41,938 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:29:41,999 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6822187bd/3e50f7e58a4a4c7aa58246fb2cc4509c/FLAGb3779bf3c [2018-11-14 16:29:42,515 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:29:42,516 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:29:42,532 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6822187bd/3e50f7e58a4a4c7aa58246fb2cc4509c/FLAGb3779bf3c [2018-11-14 16:29:42,548 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6822187bd/3e50f7e58a4a4c7aa58246fb2cc4509c [2018-11-14 16:29:42,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:29:42,562 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:29:42,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:29:42,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:29:42,568 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:29:42,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:29:42" (1/1) ... [2018-11-14 16:29:42,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134d55dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:42, skipping insertion in model container [2018-11-14 16:29:42,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:29:42" (1/1) ... [2018-11-14 16:29:42,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:29:42,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:29:43,062 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:29:43,083 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:29:43,337 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:29:43,412 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:29:43,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43 WrapperNode [2018-11-14 16:29:43,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:29:43,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:29:43,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:29:43,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:29:43,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... [2018-11-14 16:29:43,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:29:43,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:29:43,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:29:43,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:29:43,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:29:43,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:29:43,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:29:43,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:29:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:29:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 16:29:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 16:29:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 16:29:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-14 16:29:43,615 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_insert [2018-11-14 16:29:43,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:29:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:29:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:29:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:29:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:29:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:29:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:29:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:29:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:29:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:29:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:29:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:29:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:29:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:29:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:29:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:29:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:29:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:29:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:29:43,621 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:29:43,622 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:29:43,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:29:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:29:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:29:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:29:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:29:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:29:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:29:43,625 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:29:43,626 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:29:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:29:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:29:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:29:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:29:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:29:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:29:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:29:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:29:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:29:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:29:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:29:43,629 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:29:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:29:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:29:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:29:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:29:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:29:43,630 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:29:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:29:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:29:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:29:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:29:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:29:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:29:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:29:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:29:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:29:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:29:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:29:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 16:29:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:29:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:29:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:29:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 16:29:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-14 16:29:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:29:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:29:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_insert [2018-11-14 16:29:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:29:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:29:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:29:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:29:43,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:29:45,670 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:29:45,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:29:45 BoogieIcfgContainer [2018-11-14 16:29:45,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:29:45,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:29:45,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:29:45,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:29:45,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:29:42" (1/3) ... [2018-11-14 16:29:45,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1b43c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:29:45, skipping insertion in model container [2018-11-14 16:29:45,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:29:43" (2/3) ... [2018-11-14 16:29:45,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b1b43c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:29:45, skipping insertion in model container [2018-11-14 16:29:45,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:29:45" (3/3) ... [2018-11-14 16:29:45,680 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 16:29:45,691 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:29:45,701 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:29:45,722 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:29:45,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:29:45,760 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:29:45,760 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:29:45,760 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:29:45,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:29:45,761 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:29:45,761 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:29:45,761 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:29:45,761 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:29:45,787 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-14 16:29:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:29:45,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:29:45,801 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:29:45,804 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:29:45,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:29:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash 180157280, now seen corresponding path program 1 times [2018-11-14 16:29:45,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:29:45,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:29:45,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:29:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:46,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:29:46,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-14 16:29:46,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {63#true} is VALID [2018-11-14 16:29:46,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 16:29:46,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #151#return; {63#true} is VALID [2018-11-14 16:29:46,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret24 := main(); {63#true} is VALID [2018-11-14 16:29:46,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {63#true} is VALID [2018-11-14 16:29:46,248 INFO L256 TraceCheckUtils]: 6: Hoare triple {63#true} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {63#true} is VALID [2018-11-14 16:29:46,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {63#true} ~len := #in~len;~data := #in~data; {63#true} is VALID [2018-11-14 16:29:46,249 INFO L256 TraceCheckUtils]: 8: Hoare triple {63#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {63#true} is VALID [2018-11-14 16:29:46,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {63#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; {63#true} is VALID [2018-11-14 16:29:46,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {63#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {63#true} is VALID [2018-11-14 16:29:46,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {63#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; {63#true} is VALID [2018-11-14 16:29:46,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 16:29:46,251 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {63#true} {63#true} #137#return; {63#true} is VALID [2018-11-14 16:29:46,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {63#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; {63#true} is VALID [2018-11-14 16:29:46,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {63#true} assume !true; {64#false} is VALID [2018-11-14 16:29:46,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#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; {64#false} is VALID [2018-11-14 16:29:46,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-14 16:29:46,268 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {64#false} {63#true} #143#return; {64#false} is VALID [2018-11-14 16:29:46,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#false} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret17.base, #t~ret17.offset; {64#false} is VALID [2018-11-14 16:29:46,269 INFO L256 TraceCheckUtils]: 20: Hoare triple {64#false} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {64#false} is VALID [2018-11-14 16:29:46,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {64#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {64#false} is VALID [2018-11-14 16:29:46,270 INFO L256 TraceCheckUtils]: 22: Hoare triple {64#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {64#false} is VALID [2018-11-14 16:29:46,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {64#false} ~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; {64#false} is VALID [2018-11-14 16:29:46,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {64#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {64#false} is VALID [2018-11-14 16:29:46,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {64#false} 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; {64#false} is VALID [2018-11-14 16:29:46,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-14 16:29:46,271 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {64#false} {64#false} #149#return; {64#false} is VALID [2018-11-14 16:29:46,272 INFO L273 TraceCheckUtils]: 28: Hoare triple {64#false} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {64#false} is VALID [2018-11-14 16:29:46,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 16:29:46,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {64#false} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32); {64#false} is VALID [2018-11-14 16:29:46,273 INFO L273 TraceCheckUtils]: 31: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-14 16:29:46,273 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {64#false} {64#false} #145#return; {64#false} is VALID [2018-11-14 16:29:46,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {64#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0bv32; {64#false} is VALID [2018-11-14 16:29:46,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 16:29:46,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {64#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {64#false} is VALID [2018-11-14 16:29:46,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-14 16:29:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:29:46,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:29:46,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:29:46,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:29:46,298 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 16:29:46,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:29:46,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:29:46,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:29:46,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:29:46,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:29:46,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:29:46,475 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-14 16:29:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:46,889 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-11-14 16:29:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:29:46,889 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 16:29:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:29:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:29:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 16:29:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:29:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 16:29:46,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 131 transitions. [2018-11-14 16:29:47,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:29:47,450 INFO L225 Difference]: With dead ends: 104 [2018-11-14 16:29:47,450 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:29:47,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:29:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:29:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 16:29:47,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:29:47,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 16:29:47,514 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:29:47,514 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:29:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:47,521 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 16:29:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 16:29:47,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:47,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:47,523 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 16:29:47,523 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 16:29:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:47,531 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 16:29:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 16:29:47,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:47,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:47,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:29:47,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:29:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 16:29:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-14 16:29:47,539 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 37 [2018-11-14 16:29:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:29:47,540 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-14 16:29:47,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:29:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 16:29:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:29:47,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:29:47,542 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:29:47,543 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:29:47,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:29:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1248325383, now seen corresponding path program 1 times [2018-11-14 16:29:47,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:29:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:29:47,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:29:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:47,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:29:47,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2018-11-14 16:29:47,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {460#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {460#true} is VALID [2018-11-14 16:29:47,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 16:29:47,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #151#return; {460#true} is VALID [2018-11-14 16:29:47,793 INFO L256 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret24 := main(); {460#true} is VALID [2018-11-14 16:29:47,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {460#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {460#true} is VALID [2018-11-14 16:29:47,794 INFO L256 TraceCheckUtils]: 6: Hoare triple {460#true} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {460#true} is VALID [2018-11-14 16:29:47,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {460#true} ~len := #in~len;~data := #in~data; {460#true} is VALID [2018-11-14 16:29:47,795 INFO L256 TraceCheckUtils]: 8: Hoare triple {460#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {460#true} is VALID [2018-11-14 16:29:47,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#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; {460#true} is VALID [2018-11-14 16:29:47,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {460#true} is VALID [2018-11-14 16:29:47,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {460#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; {460#true} is VALID [2018-11-14 16:29:47,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 16:29:47,796 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {460#true} {460#true} #137#return; {460#true} is VALID [2018-11-14 16:29:47,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {460#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; {460#true} is VALID [2018-11-14 16:29:47,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 16:29:47,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {460#true} assume !~bvsgt32(~len, 1bv32); {460#true} is VALID [2018-11-14 16:29:47,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {460#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; {460#true} is VALID [2018-11-14 16:29:47,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 16:29:47,798 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {460#true} {460#true} #143#return; {460#true} is VALID [2018-11-14 16:29:47,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {460#true} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret17.base, #t~ret17.offset; {460#true} is VALID [2018-11-14 16:29:47,799 INFO L256 TraceCheckUtils]: 21: Hoare triple {460#true} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {460#true} is VALID [2018-11-14 16:29:47,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {460#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {460#true} is VALID [2018-11-14 16:29:47,800 INFO L256 TraceCheckUtils]: 23: Hoare triple {460#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {460#true} is VALID [2018-11-14 16:29:47,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {460#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; {460#true} is VALID [2018-11-14 16:29:47,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {460#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {460#true} is VALID [2018-11-14 16:29:47,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {460#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; {460#true} is VALID [2018-11-14 16:29:47,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {460#true} assume true; {460#true} is VALID [2018-11-14 16:29:47,801 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {460#true} {460#true} #149#return; {460#true} is VALID [2018-11-14 16:29:47,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {460#true} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {552#(and (= (_ bv0 32) dll_circular_insert_~snd_to_last~0.offset) (= dll_circular_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-14 16:29:47,808 INFO L273 TraceCheckUtils]: 30: Hoare triple {552#(and (= (_ bv0 32) dll_circular_insert_~snd_to_last~0.offset) (= dll_circular_insert_~snd_to_last~0.base (_ bv0 32)))} assume true; {552#(and (= (_ bv0 32) dll_circular_insert_~snd_to_last~0.offset) (= dll_circular_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-14 16:29:47,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {552#(and (= (_ bv0 32) dll_circular_insert_~snd_to_last~0.offset) (= dll_circular_insert_~snd_to_last~0.base (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {552#(and (= (_ bv0 32) dll_circular_insert_~snd_to_last~0.offset) (= dll_circular_insert_~snd_to_last~0.base (_ bv0 32)))} is VALID [2018-11-14 16:29:47,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {552#(and (= (_ bv0 32) dll_circular_insert_~snd_to_last~0.offset) (= dll_circular_insert_~snd_to_last~0.base (_ bv0 32)))} assume ~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset, 4bv32);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~1.base, ~bvadd32(4bv32, ~last~1.offset), 4bv32); {461#false} is VALID [2018-11-14 16:29:47,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {461#false} assume true; {461#false} is VALID [2018-11-14 16:29:47,841 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {461#false} {460#true} #145#return; {461#false} is VALID [2018-11-14 16:29:47,841 INFO L273 TraceCheckUtils]: 35: Hoare triple {461#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0bv32; {461#false} is VALID [2018-11-14 16:29:47,841 INFO L273 TraceCheckUtils]: 36: Hoare triple {461#false} assume true;call #t~mem20 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(8bv32, ~ptr~0.offset), 4bv32); {461#false} is VALID [2018-11-14 16:29:47,842 INFO L273 TraceCheckUtils]: 37: Hoare triple {461#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {461#false} is VALID [2018-11-14 16:29:47,842 INFO L273 TraceCheckUtils]: 38: Hoare triple {461#false} assume !false; {461#false} is VALID [2018-11-14 16:29:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 16:29:47,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:29:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:29:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:29:47,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 16:29:47,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:29:47,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:29:47,968 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 16:29:47,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:29:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:29:47,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:29:47,969 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-11-14 16:29:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:48,557 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-14 16:29:48,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:29:48,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 16:29:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:29:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:29:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 16:29:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:29:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 16:29:48,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-14 16:29:48,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:29:48,776 INFO L225 Difference]: With dead ends: 59 [2018-11-14 16:29:48,776 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 16:29:48,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:29:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 16:29:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 16:29:48,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:29:48,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 16:29:48,798 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 16:29:48,798 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 16:29:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:48,803 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 16:29:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-14 16:29:48,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:48,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:48,805 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 16:29:48,805 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 16:29:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:48,810 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 16:29:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-14 16:29:48,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:48,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:48,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:29:48,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:29:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:29:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-14 16:29:48,815 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 39 [2018-11-14 16:29:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:29:48,815 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-14 16:29:48,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:29:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-14 16:29:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:29:48,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:29:48,817 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-14 16:29:48,818 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:29:48,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:29:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1678898253, now seen corresponding path program 1 times [2018-11-14 16:29:48,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:29:48,819 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:29:48,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:29:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:48,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:29:49,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {819#true} call ULTIMATE.init(); {819#true} is VALID [2018-11-14 16:29:49,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {819#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {819#true} is VALID [2018-11-14 16:29:49,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-14 16:29:49,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {819#true} {819#true} #151#return; {819#true} is VALID [2018-11-14 16:29:49,060 INFO L256 TraceCheckUtils]: 4: Hoare triple {819#true} call #t~ret24 := main(); {819#true} is VALID [2018-11-14 16:29:49,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {819#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {839#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 16:29:49,062 INFO L256 TraceCheckUtils]: 6: Hoare triple {839#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {819#true} is VALID [2018-11-14 16:29:49,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {819#true} ~len := #in~len;~data := #in~data; {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 16:29:49,063 INFO L256 TraceCheckUtils]: 8: Hoare triple {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {819#true} is VALID [2018-11-14 16:29:49,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#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; {819#true} is VALID [2018-11-14 16:29:49,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {819#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {819#true} is VALID [2018-11-14 16:29:49,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {819#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; {819#true} is VALID [2018-11-14 16:29:49,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-14 16:29:49,065 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {819#true} {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} #137#return; {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 16:29:49,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {846#(= |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; {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 16:29:49,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 16:29:49,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {846#(= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {874#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:29:49,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {874#(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; {874#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:29:49,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {874#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} assume true; {874#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 16:29:49,076 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {874#(not (bvsgt |dll_circular_create_#in~len| (_ bv1 32)))} {839#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #143#return; {820#false} is VALID [2018-11-14 16:29:49,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {820#false} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret17.base, #t~ret17.offset; {820#false} is VALID [2018-11-14 16:29:49,076 INFO L256 TraceCheckUtils]: 21: Hoare triple {820#false} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {820#false} is VALID [2018-11-14 16:29:49,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {820#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {820#false} is VALID [2018-11-14 16:29:49,077 INFO L256 TraceCheckUtils]: 23: Hoare triple {820#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {820#false} is VALID [2018-11-14 16:29:49,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {820#false} ~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; {820#false} is VALID [2018-11-14 16:29:49,078 INFO L273 TraceCheckUtils]: 25: Hoare triple {820#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {820#false} is VALID [2018-11-14 16:29:49,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {820#false} 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; {820#false} is VALID [2018-11-14 16:29:49,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {820#false} assume true; {820#false} is VALID [2018-11-14 16:29:49,078 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {820#false} {820#false} #149#return; {820#false} is VALID [2018-11-14 16:29:49,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {820#false} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {820#false} is VALID [2018-11-14 16:29:49,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {820#false} assume true; {820#false} is VALID [2018-11-14 16:29:49,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {820#false} assume !~bvsgt32(~index, 0bv32); {820#false} is VALID [2018-11-14 16:29:49,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {820#false} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {820#false} is VALID [2018-11-14 16:29:49,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {820#false} assume #t~mem12.base != 0bv32 || #t~mem12.offset != 0bv32;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem14.base, #t~mem14.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem15.base, #t~mem15.offset, 4bv32);havoc #t~mem15.base, #t~mem15.offset;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem16.base, ~bvadd32(4bv32, #t~mem16.offset), 4bv32);havoc #t~mem16.base, #t~mem16.offset; {820#false} is VALID [2018-11-14 16:29:49,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {820#false} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {820#false} is VALID [2018-11-14 16:29:49,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {820#false} assume true; {820#false} is VALID [2018-11-14 16:29:49,081 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {820#false} {820#false} #145#return; {820#false} is VALID [2018-11-14 16:29:49,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {820#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0bv32; {820#false} is VALID [2018-11-14 16:29:49,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {820#false} assume true;call #t~mem20 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(8bv32, ~ptr~0.offset), 4bv32); {820#false} is VALID [2018-11-14 16:29:49,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {820#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {820#false} is VALID [2018-11-14 16:29:49,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {820#false} assume !false; {820#false} is VALID [2018-11-14 16:29:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:29:49,086 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:29:49,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:29:49,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:29:49,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-14 16:29:49,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:29:49,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:29:49,306 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 16:29:49,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:29:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:29:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:29:49,308 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 5 states. [2018-11-14 16:29:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:50,488 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-14 16:29:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:29:50,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-14 16:29:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:29:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:29:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-14 16:29:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:29:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-14 16:29:50,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2018-11-14 16:29:50,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:29:50,839 INFO L225 Difference]: With dead ends: 84 [2018-11-14 16:29:50,839 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 16:29:50,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:29:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 16:29:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-14 16:29:50,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:29:50,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2018-11-14 16:29:50,892 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2018-11-14 16:29:50,892 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2018-11-14 16:29:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:50,898 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-14 16:29:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-14 16:29:50,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:50,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:50,899 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2018-11-14 16:29:50,900 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2018-11-14 16:29:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:50,903 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-14 16:29:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-14 16:29:50,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:50,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:50,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:29:50,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:29:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:29:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-14 16:29:50,909 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 41 [2018-11-14 16:29:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:29:50,909 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-14 16:29:50,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:29:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-14 16:29:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 16:29:50,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:29:50,912 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:29:50,912 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:29:50,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:29:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1614910049, now seen corresponding path program 1 times [2018-11-14 16:29:50,913 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:29:50,913 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:29:50,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:29:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:51,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:29:51,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:29:51,444 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 16:29:51,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-14 16:29:51,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:29:51,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:29:51,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:29:51,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:29:51,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:51,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-14 16:29:51,965 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:29:52,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:29:52,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:29:52,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:29:52,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-14 16:29:52,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2018-11-14 16:29:52,244 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:29:52,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 16:29:52,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 16:29:52,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:52,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-14 16:29:52,354 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:29:52,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1232#true} is VALID [2018-11-14 16:29:52,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {1232#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1232#true} is VALID [2018-11-14 16:29:52,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2018-11-14 16:29:52,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #151#return; {1232#true} is VALID [2018-11-14 16:29:52,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret24 := main(); {1232#true} is VALID [2018-11-14 16:29:52,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {1232#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:29:52,407 INFO L256 TraceCheckUtils]: 6: Hoare triple {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {1232#true} is VALID [2018-11-14 16:29:52,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {1232#true} ~len := #in~len;~data := #in~data; {1232#true} is VALID [2018-11-14 16:29:52,408 INFO L256 TraceCheckUtils]: 8: Hoare triple {1232#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1232#true} is VALID [2018-11-14 16:29:52,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {1232#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1232#true} is VALID [2018-11-14 16:29:52,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {1232#true} assume true; {1232#true} is VALID [2018-11-14 16:29:52,409 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1232#true} {1232#true} #137#return; {1232#true} is VALID [2018-11-14 16:29:52,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {1232#true} assume true; {1232#true} is VALID [2018-11-14 16:29:52,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {1232#true} assume !!~bvsgt32(~len, 1bv32); {1232#true} is VALID [2018-11-14 16:29:52,410 INFO L256 TraceCheckUtils]: 17: Hoare triple {1232#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1232#true} is VALID [2018-11-14 16:29:52,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {1232#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1232#true} is VALID [2018-11-14 16:29:52,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {1232#true} assume true; {1232#true} is VALID [2018-11-14 16:29:52,412 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1232#true} {1232#true} #139#return; {1232#true} is VALID [2018-11-14 16:29:52,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {1232#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); {1232#true} is VALID [2018-11-14 16:29:52,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {1232#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); {1232#true} is VALID [2018-11-14 16:29:52,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {1232#true} assume true; {1232#true} is VALID [2018-11-14 16:29:52,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {1232#true} assume !~bvsgt32(~len, 1bv32); {1232#true} is VALID [2018-11-14 16:29:52,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {1232#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; {1232#true} is VALID [2018-11-14 16:29:52,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {1232#true} assume true; {1232#true} is VALID [2018-11-14 16:29:52,416 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1232#true} {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #143#return; {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:29:52,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret17.base, #t~ret17.offset; {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:29:52,417 INFO L256 TraceCheckUtils]: 32: Hoare triple {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, ~bvsdiv32(~len~0, 2bv32)); {1232#true} is VALID [2018-11-14 16:29:52,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {1232#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1337#(and (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= |dll_circular_insert_#in~data| dll_circular_insert_~data))} is VALID [2018-11-14 16:29:52,419 INFO L256 TraceCheckUtils]: 34: Hoare triple {1337#(and (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= |dll_circular_insert_#in~data| dll_circular_insert_~data))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {1232#true} is VALID [2018-11-14 16:29:52,420 INFO L273 TraceCheckUtils]: 35: Hoare triple {1232#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; {1344#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {1344#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1344#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {1344#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)))} 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; {1351#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv8 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:29:52,427 INFO L273 TraceCheckUtils]: 38: Hoare triple {1351#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv8 32)))) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1351#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv8 32)))) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 16:29:52,431 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1351#(and (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv8 32)))) (= |node_create_#res.offset| (_ bv0 32)))} {1337#(and (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= |dll_circular_insert_#in~data| dll_circular_insert_~data))} #149#return; {1358#(and (= (select (select |#memory_int| |dll_circular_insert_#t~ret8.base|) (bvadd |dll_circular_insert_#t~ret8.offset| (_ bv8 32))) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= |dll_circular_insert_#t~ret8.offset| (_ bv0 32)))} is VALID [2018-11-14 16:29:52,437 INFO L273 TraceCheckUtils]: 40: Hoare triple {1358#(and (= (select (select |#memory_int| |dll_circular_insert_#t~ret8.base|) (bvadd |dll_circular_insert_#t~ret8.offset| (_ bv8 32))) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= |dll_circular_insert_#t~ret8.offset| (_ bv0 32)))} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0bv32, 0bv32;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,438 INFO L273 TraceCheckUtils]: 41: Hoare triple {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} assume true; {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,443 INFO L273 TraceCheckUtils]: 42: Hoare triple {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,444 INFO L273 TraceCheckUtils]: 43: Hoare triple {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} assume !(~snd_to_last~0.base != 0bv32 || ~snd_to_last~0.offset != 0bv32);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} assume #t~mem12.base != 0bv32 || #t~mem12.offset != 0bv32;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~new_node~0.base, ~new_node~0.offset, 4bv32);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem14.base, #t~mem14.offset, ~new_node~0.base, ~bvadd32(4bv32, ~new_node~0.offset), 4bv32);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem15.base, #t~mem15.offset, 4bv32);havoc #t~mem15.base, #t~mem15.offset;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem16.base, ~bvadd32(4bv32, #t~mem16.offset), 4bv32);havoc #t~mem16.base, #t~mem16.offset; {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {1362#(and (= (select (select |#memory_int| dll_circular_insert_~new_node~0.base) (_ bv8 32)) |dll_circular_insert_#in~data|) (= |dll_circular_insert_#in~head.offset| dll_circular_insert_~head.offset) (= dll_circular_insert_~head.base |dll_circular_insert_#in~head.base|) (= dll_circular_insert_~new_node~0.offset (_ bv0 32)))} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4bv32); {1378#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (_ bv8 32)) |dll_circular_insert_#in~data|))} is VALID [2018-11-14 16:29:52,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {1378#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (_ bv8 32)) |dll_circular_insert_#in~data|))} assume true; {1378#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (_ bv8 32)) |dll_circular_insert_#in~data|))} is VALID [2018-11-14 16:29:52,471 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1378#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |dll_circular_insert_#in~head.base|) |dll_circular_insert_#in~head.offset|)) (_ bv8 32)) |dll_circular_insert_#in~data|))} {1252#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #145#return; {1385#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:29:52,476 INFO L273 TraceCheckUtils]: 48: Hoare triple {1385#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv8 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0bv32; {1389#(and (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv8 32))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 16:29:52,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {1389#(and (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv8 32))) (= main_~ptr~0.offset (_ bv0 32)))} assume true;call #t~mem20 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(8bv32, ~ptr~0.offset), 4bv32); {1393#(and (= |main_#t~mem20| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:29:52,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {1393#(and (= |main_#t~mem20| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem20;havoc #t~mem20; {1233#false} is VALID [2018-11-14 16:29:52,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2018-11-14 16:29:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 16:29:52,490 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:29:52,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:29:52,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-14 16:29:52,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-14 16:29:52,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:29:52,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:29:52,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:29:52,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:29:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:29:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:29:52,606 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 12 states. [2018-11-14 16:29:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:57,841 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-11-14 16:29:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:29:57,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-14 16:29:57,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:29:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:29:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2018-11-14 16:29:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:29:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2018-11-14 16:29:57,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 67 transitions. [2018-11-14 16:29:58,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:29:58,010 INFO L225 Difference]: With dead ends: 63 [2018-11-14 16:29:58,010 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 16:29:58,011 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:29:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 16:29:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-14 16:29:58,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:29:58,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-14 16:29:58,092 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-14 16:29:58,092 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-14 16:29:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:58,095 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 16:29:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 16:29:58,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:58,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:58,098 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-14 16:29:58,098 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-14 16:29:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:29:58,107 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 16:29:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 16:29:58,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:29:58,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:29:58,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:29:58,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:29:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 16:29:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-14 16:29:58,111 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 52 [2018-11-14 16:29:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:29:58,111 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-14 16:29:58,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:29:58,111 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-14 16:29:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 16:29:58,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:29:58,116 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:29:58,116 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:29:58,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:29:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1242292531, now seen corresponding path program 1 times [2018-11-14 16:29:58,117 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:29:58,117 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:29:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:29:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:29:58,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:29:58,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 16:29:58,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:58,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:58,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-14 16:29:58,490 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:29:58,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:29:58,847 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 16:29:58,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:58,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:58,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:58,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 16:29:59,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:29:59,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:29:59,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:59,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:59,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:59,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-14 16:29:59,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:29:59,320 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 16:29:59,330 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 16:29:59,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:29:59,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:29:59,391 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 16:29:59,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2018-11-14 16:29:59,410 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:30:01,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:01,959 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 97 treesize of output 82 [2018-11-14 16:30:01,999 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 25 [2018-11-14 16:30:02,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:30:02,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:02,102 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 76 treesize of output 68 [2018-11-14 16:30:02,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:02,124 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 67 treesize of output 86 [2018-11-14 16:30:02,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:30:02,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:30:02,219 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 16:30:02,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:30:02,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:82 [2018-11-14 16:30:02,322 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:30:02,619 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-11-14 16:30:02,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:02,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:02,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:02,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-11-14 16:30:02,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2018-11-14 16:30:02,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:30:02,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:30:03,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:30:03,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:83 [2018-11-14 16:30:03,025 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:30:03,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:30:03,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 76 [2018-11-14 16:30:03,402 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 18 treesize of output 16 [2018-11-14 16:30:03,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:30:03,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:30:03,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 16:30:03,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 16:30:03,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:30:03,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:30:03,706 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 16:30:03,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:125 [2018-11-14 16:30:06,679 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-14 16:30:09,240 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 16:30:11,902 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 16:30:14,647 WARN L179 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 16:30:19,429 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_insert_~last~1.offset (_ BitVec 32)) (dll_circular_insert_~snd_to_last~0.offset (_ BitVec 32)) (node_create_~data (_ BitVec 32)) (dll_circular_insert_~new_node~0.offset (_ BitVec 32)) (dll_circular_insert_~new_node~0.base (_ BitVec 32))) (let ((.cse9 (store |c_old(#memory_$Pointer$.base)| dll_circular_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.base)| dll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))))) (let ((.cse6 (select (select .cse9 |c_dll_circular_insert_#in~head.base|) |c_dll_circular_insert_#in~head.offset|))) (let ((.cse10 (select .cse9 .cse6)) (.cse5 (store |c_old(#memory_$Pointer$.offset)| dll_circular_insert_~new_node~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| dll_circular_insert_~new_node~0.base) (_ bv0 32) (_ bv0 32)) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (bvadd dll_circular_insert_~last~1.offset (_ bv4 32))) (.cse4 (bvadd dll_circular_insert_~new_node~0.offset (_ bv4 32))) (.cse1 (select .cse10 (select (select .cse5 |c_dll_circular_insert_#in~head.base|) |c_dll_circular_insert_#in~head.offset|)))) (and (not (= dll_circular_insert_~new_node~0.base (_ bv0 32))) (= (let ((.cse0 (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) dll_circular_insert_~snd_to_last~0.offset dll_circular_insert_~new_node~0.offset)))) (store .cse3 dll_circular_insert_~new_node~0.base (store (store (select .cse3 dll_circular_insert_~new_node~0.base) .cse4 dll_circular_insert_~snd_to_last~0.offset) dll_circular_insert_~new_node~0.offset dll_circular_insert_~last~1.offset))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 dll_circular_insert_~new_node~0.offset))) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| dll_circular_insert_~new_node~0.base)) (= (let ((.cse7 (let ((.cse8 (store .cse9 .cse6 (store .cse10 dll_circular_insert_~snd_to_last~0.offset dll_circular_insert_~new_node~0.base)))) (store .cse8 dll_circular_insert_~new_node~0.base (store (store (select .cse8 dll_circular_insert_~new_node~0.base) .cse4 .cse6) dll_circular_insert_~new_node~0.offset .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 dll_circular_insert_~new_node~0.base))) |c_#memory_$Pointer$.base|) (= |c_#memory_int| (store |c_old(#memory_int)| dll_circular_insert_~new_node~0.base (store (select |c_old(#memory_int)| dll_circular_insert_~new_node~0.base) (_ bv8 32) node_create_~data))))))))) is different from true