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_Default-Const.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:13:02,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:13:02,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:13:02,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:13:02,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:13:02,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:13:02,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:13:02,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:13:02,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:13:02,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:13:02,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:13:02,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:13:02,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:13:02,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:13:02,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:13:02,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:13:02,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:13:02,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:13:02,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:13:02,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:13:02,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:13:02,930 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:13:02,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:13:02,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:13:02,933 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:13:02,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:13:02,935 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:13:02,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:13:02,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:13:02,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:13:02,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:13:02,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:13:02,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:13:02,940 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:13:02,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:13:02,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:13:02,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:13:02,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:13:02,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:13:02,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:13:02,967 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:13:02,968 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:13:02,968 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:13:02,968 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:13:02,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:13:02,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:13:02,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:13:02,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:13:02,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:13:02,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:13:02,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:13:02,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:13:02,970 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:13:02,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:13:02,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:13:02,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:13:02,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:13:02,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:13:02,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:13:02,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:13:02,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:13:02,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:13:02,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:13:02,972 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:13:02,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:13:02,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:13:02,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:13:02,973 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:13:03,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:13:03,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:13:03,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:13:03,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:13:03,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:13:03,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:13:03,097 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed3cf2b3/cee610d907c04b869a951221b6663a6b/FLAG7de2f138c [2018-11-14 19:13:03,611 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:13:03,612 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:13:03,626 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed3cf2b3/cee610d907c04b869a951221b6663a6b/FLAG7de2f138c [2018-11-14 19:13:03,640 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed3cf2b3/cee610d907c04b869a951221b6663a6b [2018-11-14 19:13:03,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:13:03,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:13:03,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:13:03,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:13:03,657 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:13:03,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:13:03" (1/1) ... [2018-11-14 19:13:03,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49326289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:03, skipping insertion in model container [2018-11-14 19:13:03,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:13:03" (1/1) ... [2018-11-14 19:13:03,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:13:03,722 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:13:04,078 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:13:04,093 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:13:04,209 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:13:04,351 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:13:04,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04 WrapperNode [2018-11-14 19:13:04,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:13:04,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:13:04,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:13:04,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:13:04,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:13:04,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:13:04,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:13:04,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:13:04,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (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 19:13:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:13:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:13:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:13:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:13:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 19:13:04,556 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 19:13:04,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 19:13:04,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-14 19:13:04,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_append [2018-11-14 19:13:04,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:13:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:13:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:13:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:13:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:13:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:13:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:13:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:13:04,561 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:13:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:13:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:13:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:13:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:13:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:13:04,562 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:13:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:13:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:13:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:13:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:13:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:13:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:13:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:13:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:13:04,566 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:13:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:13:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:13:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:13:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:13:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:13:04,568 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:13:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:13:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:13:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:13:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:13:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:13:04,569 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:13:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:13:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:13:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:13:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:13:04,570 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:13:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:13:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:13:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:13:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:13:04,572 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:13:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:13:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:13:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:13:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:13:04,573 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:13:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:13:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:13:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:13:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:13:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:13:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:13:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:13:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:13:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:13:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:13:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:13:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:13:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:13:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:13:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:13:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 19:13:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:13:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:13:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:13:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 19:13:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-14 19:13:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:13:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:13:04,577 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_append [2018-11-14 19:13:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:13:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:13:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:13:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:13:04,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:13:05,714 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:13:05,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:13:05 BoogieIcfgContainer [2018-11-14 19:13:05,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:13:05,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:13:05,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:13:05,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:13:05,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:13:03" (1/3) ... [2018-11-14 19:13:05,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d9551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:13:05, skipping insertion in model container [2018-11-14 19:13:05,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04" (2/3) ... [2018-11-14 19:13:05,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d9551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:13:05, skipping insertion in model container [2018-11-14 19:13:05,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:13:05" (3/3) ... [2018-11-14 19:13:05,724 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:13:05,733 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:13:05,742 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:13:05,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:13:05,786 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:13:05,787 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:13:05,787 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:13:05,788 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:13:05,788 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:13:05,788 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:13:05,789 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:13:05,789 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:13:05,789 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:13:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-14 19:13:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 19:13:05,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:05,827 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] [2018-11-14 19:13:05,830 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:05,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1152284491, now seen corresponding path program 1 times [2018-11-14 19:13:05,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:05,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:05,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:05,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:05,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:06,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {61#true} call ULTIMATE.init(); {61#true} is VALID [2018-11-14 19:13:06,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {61#true} is VALID [2018-11-14 19:13:06,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 19:13:06,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61#true} {61#true} #137#return; {61#true} is VALID [2018-11-14 19:13:06,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {61#true} call #t~ret24 := main(); {61#true} is VALID [2018-11-14 19:13:06,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {61#true} is VALID [2018-11-14 19:13:06,136 INFO L256 TraceCheckUtils]: 6: Hoare triple {61#true} call #t~ret14.base, #t~ret14.offset := dll_circular_create(~len~0, ~data~0); {61#true} is VALID [2018-11-14 19:13:06,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#true} ~len := #in~len;~data := #in~data; {61#true} is VALID [2018-11-14 19:13:06,136 INFO L256 TraceCheckUtils]: 8: Hoare triple {61#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {61#true} is VALID [2018-11-14 19:13:06,137 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {61#true} is VALID [2018-11-14 19:13:06,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {61#true} is VALID [2018-11-14 19:13:06,138 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {61#true} is VALID [2018-11-14 19:13:06,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 19:13:06,138 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {61#true} {61#true} #123#return; {61#true} is VALID [2018-11-14 19:13:06,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#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; {61#true} is VALID [2018-11-14 19:13:06,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {61#true} assume !true; {62#false} is VALID [2018-11-14 19:13:06,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {62#false} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {62#false} is VALID [2018-11-14 19:13:06,140 INFO L273 TraceCheckUtils]: 17: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 19:13:06,141 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {62#false} {61#true} #129#return; {62#false} is VALID [2018-11-14 19:13:06,141 INFO L273 TraceCheckUtils]: 19: Hoare triple {62#false} call write~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret14.base, #t~ret14.offset;~uneq~0 := 5; {62#false} is VALID [2018-11-14 19:13:06,141 INFO L256 TraceCheckUtils]: 20: Hoare triple {62#false} call dll_circular_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {61#true} is VALID [2018-11-14 19:13:06,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {61#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {61#true} is VALID [2018-11-14 19:13:06,142 INFO L256 TraceCheckUtils]: 22: Hoare triple {61#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {61#true} is VALID [2018-11-14 19:13:06,142 INFO L273 TraceCheckUtils]: 23: Hoare triple {61#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {61#true} is VALID [2018-11-14 19:13:06,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {61#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {61#true} is VALID [2018-11-14 19:13:06,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {61#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {61#true} is VALID [2018-11-14 19:13:06,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 19:13:06,143 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {61#true} {61#true} #135#return; {61#true} is VALID [2018-11-14 19:13:06,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {61#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4); {61#true} is VALID [2018-11-14 19:13:06,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {61#true} assume 0 == #t~mem9.base && 0 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 4, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 0, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {61#true} is VALID [2018-11-14 19:13:06,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 19:13:06,144 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {61#true} {62#false} #131#return; {62#false} is VALID [2018-11-14 19:13:06,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {62#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;~count~0 := 0; {62#false} is VALID [2018-11-14 19:13:06,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {62#false} assume true;call #t~mem18 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {62#false} is VALID [2018-11-14 19:13:06,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {62#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {62#false} is VALID [2018-11-14 19:13:06,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {62#false} assume !false; {62#false} is VALID [2018-11-14 19:13:06,154 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 19:13:06,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:13:06,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:13:06,165 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 19:13:06,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:06,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:13:06,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:13:06,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:13:06,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:13:06,570 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-14 19:13:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:07,166 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2018-11-14 19:13:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:13:07,167 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 19:13:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:13:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2018-11-14 19:13:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:13:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 122 transitions. [2018-11-14 19:13:07,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 122 transitions. [2018-11-14 19:13:07,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:07,685 INFO L225 Difference]: With dead ends: 100 [2018-11-14 19:13:07,685 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 19:13:07,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 19:13:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 19:13:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 19:13:07,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:07,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 19:13:07,746 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:13:07,746 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:13:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:07,753 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 19:13:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 19:13:07,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:07,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:07,755 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 19:13:07,755 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 19:13:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:07,761 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 19:13:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 19:13:07,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:07,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:07,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:07,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 19:13:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-14 19:13:07,769 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 36 [2018-11-14 19:13:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:07,770 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-14 19:13:07,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:13:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 19:13:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 19:13:07,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:07,772 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 19:13:07,773 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:07,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:07,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1217641834, now seen corresponding path program 1 times [2018-11-14 19:13:07,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:07,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:07,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:08,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2018-11-14 19:13:08,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {337#true} is VALID [2018-11-14 19:13:08,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-14 19:13:08,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} #137#return; {337#true} is VALID [2018-11-14 19:13:08,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {337#true} call #t~ret24 := main(); {337#true} is VALID [2018-11-14 19:13:08,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {337#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {339#(<= 2 main_~len~0)} is VALID [2018-11-14 19:13:08,007 INFO L256 TraceCheckUtils]: 6: Hoare triple {339#(<= 2 main_~len~0)} call #t~ret14.base, #t~ret14.offset := dll_circular_create(~len~0, ~data~0); {337#true} is VALID [2018-11-14 19:13:08,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {337#true} ~len := #in~len;~data := #in~data; {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:08,008 INFO L256 TraceCheckUtils]: 8: Hoare triple {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {337#true} is VALID [2018-11-14 19:13:08,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {337#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {337#true} is VALID [2018-11-14 19:13:08,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {337#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {337#true} is VALID [2018-11-14 19:13:08,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {337#true} is VALID [2018-11-14 19:13:08,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-14 19:13:08,015 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {337#true} {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} #123#return; {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:08,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {340#(<= |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; {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:08,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:08,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {340#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !(~len > 1); {341#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 19:13:08,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {341#(<= |dll_circular_create_#in~len| 1)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {341#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 19:13:08,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#(<= |dll_circular_create_#in~len| 1)} assume true; {341#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 19:13:08,029 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {341#(<= |dll_circular_create_#in~len| 1)} {339#(<= 2 main_~len~0)} #129#return; {338#false} is VALID [2018-11-14 19:13:08,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {338#false} call write~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret14.base, #t~ret14.offset;~uneq~0 := 5; {338#false} is VALID [2018-11-14 19:13:08,030 INFO L256 TraceCheckUtils]: 21: Hoare triple {338#false} call dll_circular_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {337#true} is VALID [2018-11-14 19:13:08,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {337#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {337#true} is VALID [2018-11-14 19:13:08,030 INFO L256 TraceCheckUtils]: 23: Hoare triple {337#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {337#true} is VALID [2018-11-14 19:13:08,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {337#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {337#true} is VALID [2018-11-14 19:13:08,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {337#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {337#true} is VALID [2018-11-14 19:13:08,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {337#true} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {337#true} is VALID [2018-11-14 19:13:08,031 INFO L273 TraceCheckUtils]: 27: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-14 19:13:08,031 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {337#true} {337#true} #135#return; {337#true} is VALID [2018-11-14 19:13:08,032 INFO L273 TraceCheckUtils]: 29: Hoare triple {337#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4); {337#true} is VALID [2018-11-14 19:13:08,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {337#true} assume 0 == #t~mem9.base && 0 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 4, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 0, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {337#true} is VALID [2018-11-14 19:13:08,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-14 19:13:08,033 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {337#true} {338#false} #131#return; {338#false} is VALID [2018-11-14 19:13:08,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {338#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;~count~0 := 0; {338#false} is VALID [2018-11-14 19:13:08,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {338#false} assume true;call #t~mem18 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {338#false} is VALID [2018-11-14 19:13:08,034 INFO L273 TraceCheckUtils]: 35: Hoare triple {338#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {338#false} is VALID [2018-11-14 19:13:08,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {338#false} assume !false; {338#false} is VALID [2018-11-14 19:13:08,036 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 19:13:08,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:13:08,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:13:08,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 19:13:08,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:08,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:13:08,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:08,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:13:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:13:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:13:08,142 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2018-11-14 19:13:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:08,551 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2018-11-14 19:13:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:13:08,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 19:13:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:13:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-14 19:13:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:13:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2018-11-14 19:13:08,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2018-11-14 19:13:08,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:08,745 INFO L225 Difference]: With dead ends: 74 [2018-11-14 19:13:08,746 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 19:13:08,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 19:13:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 19:13:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-14 19:13:08,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:08,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-14 19:13:08,781 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-14 19:13:08,781 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-14 19:13:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:08,786 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-14 19:13:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-14 19:13:08,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:08,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:08,787 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-14 19:13:08,787 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-14 19:13:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:08,792 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-14 19:13:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-14 19:13:08,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:08,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:08,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:08,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:13:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-14 19:13:08,797 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2018-11-14 19:13:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:08,798 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-14 19:13:08,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:13:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-14 19:13:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 19:13:08,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:08,800 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] [2018-11-14 19:13:08,800 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:08,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2038052148, now seen corresponding path program 1 times [2018-11-14 19:13:08,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:08,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:09,997 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-14 19:13:10,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {599#true} call ULTIMATE.init(); {599#true} is VALID [2018-11-14 19:13:10,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {599#true} is VALID [2018-11-14 19:13:10,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 19:13:10,573 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {599#true} {599#true} #137#return; {599#true} is VALID [2018-11-14 19:13:10,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {599#true} call #t~ret24 := main(); {599#true} is VALID [2018-11-14 19:13:10,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {601#(= (select |#valid| |main_~#s~0.base|) 1)} is VALID [2018-11-14 19:13:10,577 INFO L256 TraceCheckUtils]: 6: Hoare triple {601#(= (select |#valid| |main_~#s~0.base|) 1)} call #t~ret14.base, #t~ret14.offset := dll_circular_create(~len~0, ~data~0); {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:10,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {602#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:10,579 INFO L256 TraceCheckUtils]: 8: Hoare triple {602#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:10,581 INFO L273 TraceCheckUtils]: 9: Hoare triple {602#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,591 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {602#(= |#valid| |old(#valid)|)} #123#return; {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,593 INFO L273 TraceCheckUtils]: 14: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} ~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; {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 1); {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,598 INFO L256 TraceCheckUtils]: 17: Hoare triple {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:10,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {602#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {604#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {604#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {604#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,602 INFO L273 TraceCheckUtils]: 20: Hoare triple {604#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {605#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {605#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume true; {605#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,611 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {605#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (not (= 0 |node_create_#res.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} {603#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} #125#return; {606#(and (not (= 0 |dll_circular_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,615 INFO L273 TraceCheckUtils]: 23: Hoare triple {606#(and (not (= 0 |dll_circular_create_#t~ret4.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~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 + 0, 4); {607#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 dll_circular_create_~new_head~0.base)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {607#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 dll_circular_create_~new_head~0.base)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {607#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 dll_circular_create_~new_head~0.base)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {607#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 dll_circular_create_~new_head~0.base)) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {608#(and (not (= 0 dll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,622 INFO L273 TraceCheckUtils]: 26: Hoare triple {608#(and (not (= 0 dll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {608#(and (not (= 0 dll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {608#(and (not (= 0 dll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume !(~len > 1); {608#(and (not (= 0 dll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,627 INFO L273 TraceCheckUtils]: 28: Hoare triple {608#(and (not (= 0 dll_circular_create_~head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {609#(and (not (= 0 |dll_circular_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,630 INFO L273 TraceCheckUtils]: 29: Hoare triple {609#(and (not (= 0 |dll_circular_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} assume true; {609#(and (not (= 0 |dll_circular_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-14 19:13:10,633 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {609#(and (not (= 0 |dll_circular_create_#res.base|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))))} {601#(= (select |#valid| |main_~#s~0.base|) 1)} #129#return; {610#(and (not (= 0 |main_#t~ret14.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 19:13:10,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {610#(and (not (= 0 |main_#t~ret14.base|)) (= (select |#valid| |main_~#s~0.base|) 1))} call write~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret14.base, #t~ret14.offset;~uneq~0 := 5; {611#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 19:13:10,642 INFO L256 TraceCheckUtils]: 32: Hoare triple {611#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_circular_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:10,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {613#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|))} is VALID [2018-11-14 19:13:10,646 INFO L256 TraceCheckUtils]: 34: Hoare triple {613#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:10,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:10,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:10,649 INFO L273 TraceCheckUtils]: 37: Hoare triple {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {615#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-14 19:13:10,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {615#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {615#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2018-11-14 19:13:10,655 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {615#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {613#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|))} #135#return; {616#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|) (or (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= 0 (select |old(#valid)| dll_circular_append_~head.base))))} is VALID [2018-11-14 19:13:10,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {616#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|) (or (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= 0 (select |old(#valid)| dll_circular_append_~head.base))))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4); {617#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| dll_circular_append_~head.base) dll_circular_append_~head.offset) |dll_circular_append_#t~mem9.base|) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|) (or (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= 0 (select |old(#valid)| dll_circular_append_~head.base))))} is VALID [2018-11-14 19:13:10,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {617#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| dll_circular_append_~head.base) dll_circular_append_~head.offset) |dll_circular_append_#t~mem9.base|) (= dll_circular_append_~head.offset |dll_circular_append_#in~head.offset|) (or (= (select |old(#memory_$Pointer$.base)| dll_circular_append_~head.base) (select |#memory_$Pointer$.base| dll_circular_append_~head.base)) (= 0 (select |old(#valid)| dll_circular_append_~head.base))))} assume 0 == #t~mem9.base && 0 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 4, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 0, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {618#(or (= 0 (select |old(#valid)| |dll_circular_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|)))} is VALID [2018-11-14 19:13:10,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {618#(or (= 0 (select |old(#valid)| |dll_circular_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|)))} assume true; {618#(or (= 0 (select |old(#valid)| |dll_circular_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|)))} is VALID [2018-11-14 19:13:10,662 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {618#(or (= 0 (select |old(#valid)| |dll_circular_append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|)))} {611#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (select |#valid| |main_~#s~0.base|) 1))} #131#return; {600#false} is VALID [2018-11-14 19:13:10,662 INFO L273 TraceCheckUtils]: 44: Hoare triple {600#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;~count~0 := 0; {600#false} is VALID [2018-11-14 19:13:10,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {600#false} assume true;call #t~mem18 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {600#false} is VALID [2018-11-14 19:13:10,663 INFO L273 TraceCheckUtils]: 46: Hoare triple {600#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {600#false} is VALID [2018-11-14 19:13:10,663 INFO L273 TraceCheckUtils]: 47: Hoare triple {600#false} assume !false; {600#false} is VALID [2018-11-14 19:13:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 19:13:10,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:13:10,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:13:10,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:10,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:13:10,886 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 19:13:10,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:13:10,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:13:10,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-14 19:13:10,907 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:13:12,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:13:12,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:13:12,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:13:12,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-11-14 19:13:12,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-11-14 19:13:12,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:13:12,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:13:12,703 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 19:13:12,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:35 [2018-11-14 19:13:14,730 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:13:14,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 19:13:14,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 19:13:14,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:13:14,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:13:14,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 19:13:14,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:51 [2018-11-14 19:13:14,935 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:13:16,670 WARN L179 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-14 19:13:17,727 WARN L179 SmtUtils]: Spent 929.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-14 19:13:19,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {599#true} call ULTIMATE.init(); {599#true} is VALID [2018-11-14 19:13:19,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {599#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {599#true} is VALID [2018-11-14 19:13:19,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {599#true} assume true; {599#true} is VALID [2018-11-14 19:13:19,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {599#true} {599#true} #137#return; {599#true} is VALID [2018-11-14 19:13:19,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {599#true} call #t~ret24 := main(); {599#true} is VALID [2018-11-14 19:13:19,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {599#true} ~len~0 := 2;~data~0 := 1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#s~0.base, ~#s~0.offset, 4); {637#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 19:13:19,684 INFO L256 TraceCheckUtils]: 6: Hoare triple {637#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call #t~ret14.base, #t~ret14.offset := dll_circular_create(~len~0, ~data~0); {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:19,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {602#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data; {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:19,688 INFO L256 TraceCheckUtils]: 8: Hoare triple {602#(= |#valid| |old(#valid)|)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:19,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {602#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,693 INFO L273 TraceCheckUtils]: 12: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,694 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} {602#(= |#valid| |old(#valid)|)} #123#return; {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,695 INFO L273 TraceCheckUtils]: 14: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} ~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; {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume true; {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} assume !!(~len > 1); {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} is VALID [2018-11-14 19:13:19,697 INFO L256 TraceCheckUtils]: 17: Hoare triple {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {602#(= |#valid| |old(#valid)|)} is VALID [2018-11-14 19:13:19,698 INFO L273 TraceCheckUtils]: 18: Hoare triple {602#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {678#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} is VALID [2018-11-14 19:13:19,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {678#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {678#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} is VALID [2018-11-14 19:13:19,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {678#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#valid| (store |old(#valid)| node_create_~temp~0.base 1)) (not (= 0 node_create_~temp~0.base)))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {685#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} is VALID [2018-11-14 19:13:19,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {685#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} assume true; {685#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} is VALID [2018-11-14 19:13:19,703 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {685#(and (= |#valid| (store |old(#valid)| |node_create_#res.base| 1)) (= 0 (select |old(#valid)| |node_create_#res.base|)) (not (= 0 |node_create_#res.base|)))} {650#(exists ((|node_create_#t~malloc2.base| Int)) (and (= (store |old(#valid)| |node_create_#t~malloc2.base| 1) |#valid|) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0)))} #125#return; {692#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#t~ret4.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#t~ret4.base|)))) (not (= 0 |dll_circular_create_#t~ret4.base|)))} is VALID [2018-11-14 19:13:19,705 INFO L273 TraceCheckUtils]: 23: Hoare triple {692#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#t~ret4.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= 0 (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#t~ret4.base|)))) (not (= 0 |dll_circular_create_#t~ret4.base|)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4); {696#(and (not (= dll_circular_create_~new_head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base 1)))))} is VALID [2018-11-14 19:13:19,706 INFO L273 TraceCheckUtils]: 24: Hoare triple {696#(and (not (= dll_circular_create_~new_head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base 1)))))} assume ~head~0.base != 0 || ~head~0.offset != 0;call write~$Pointer$(~new_head~0.base, ~new_head~0.offset, ~head~0.base, ~head~0.offset + 4, 4); {696#(and (not (= dll_circular_create_~new_head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base 1)))))} is VALID [2018-11-14 19:13:19,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {696#(and (not (= dll_circular_create_~new_head~0.base 0)) (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~new_head~0.base 1)))))} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {703#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= dll_circular_create_~head~0.base 0)))} is VALID [2018-11-14 19:13:19,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {703#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= dll_circular_create_~head~0.base 0)))} assume true; {703#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= dll_circular_create_~head~0.base 0)))} is VALID [2018-11-14 19:13:19,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {703#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= dll_circular_create_~head~0.base 0)))} assume !(~len > 1); {703#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= dll_circular_create_~head~0.base 0)))} is VALID [2018-11-14 19:13:19,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {703#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base 1)) (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) dll_circular_create_~head~0.base) 0) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= dll_circular_create_~head~0.base 0)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset + 0, 4);call write~$Pointer$(~last~0.base, ~last~0.offset, ~head~0.base, ~head~0.offset + 4, 4);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {713#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= |dll_circular_create_#res.base| 0)))} is VALID [2018-11-14 19:13:19,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {713#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= |dll_circular_create_#res.base| 0)))} assume true; {713#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= |dll_circular_create_#res.base| 0)))} is VALID [2018-11-14 19:13:19,724 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {713#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (= (select (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base|) 0) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| 1) |dll_circular_create_#res.base| 1)) (= (select |old(#valid)| |node_create_#t~malloc2.base|) 0))) (not (= |dll_circular_create_#res.base| 0)))} {637#(and (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #129#return; {720#(and (not (= |main_~#s~0.base| |main_#t~ret14.base|)) (= (select |#valid| |main_#t~ret14.base|) 1) (not (= 0 |main_#t~ret14.base|)) (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret14.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 19:13:19,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {720#(and (not (= |main_~#s~0.base| |main_#t~ret14.base|)) (= (select |#valid| |main_#t~ret14.base|) 1) (not (= 0 |main_#t~ret14.base|)) (= |main_~#s~0.offset| 0) (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (not (= |node_create_#t~malloc2.base| |main_#t~ret14.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= (select |#valid| |main_~#s~0.base|) 1))} call write~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret14.base, #t~ret14.offset;~uneq~0 := 5; {724#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} is VALID [2018-11-14 19:13:19,729 INFO L256 TraceCheckUtils]: 32: Hoare triple {724#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} call dll_circular_append(~#s~0.base, ~#s~0.offset, ~uneq~0); {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:19,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {731#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |#valid| |old(#valid)|) (= |dll_circular_append_#in~head.offset| dll_circular_append_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:19,730 INFO L256 TraceCheckUtils]: 34: Hoare triple {731#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |#valid| |old(#valid)|) (= |dll_circular_append_#in~head.offset| dll_circular_append_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:19,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {612#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(12);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:19,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2018-11-14 19:13:19,750 INFO L273 TraceCheckUtils]: 37: Hoare triple {614#(and (= 0 (select |old(#valid)| node_create_~temp~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 0, 4);call write~$Pointer$(0, 0, ~temp~0.base, ~temp~0.offset + 4, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset + 8, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {744#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)))))} is VALID [2018-11-14 19:13:19,764 INFO L273 TraceCheckUtils]: 38: Hoare triple {744#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)))))} assume true; {744#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)))))} is VALID [2018-11-14 19:13:19,779 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {744#(and (= 0 (select |old(#valid)| |node_create_#res.base|)) (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)))))} {731#(and (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |#valid| |old(#valid)|) (= |dll_circular_append_#in~head.offset| dll_circular_append_~head.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} #135#return; {751#(and (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_append_#t~ret8.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_circular_append_#t~ret8.base|) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)))) (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |dll_circular_append_#in~head.offset| dll_circular_append_~head.offset) (= 0 (select |old(#valid)| |dll_circular_append_#t~ret8.base|)))} is VALID [2018-11-14 19:13:19,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {751#(and (exists ((node_create_~temp~0.offset Int)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |dll_circular_append_#t~ret8.base| (store (store (select |old(#memory_$Pointer$.base)| |dll_circular_append_#t~ret8.base|) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)))) (= dll_circular_append_~head.base |dll_circular_append_#in~head.base|) (= |dll_circular_append_#in~head.offset| dll_circular_append_~head.offset) (= 0 (select |old(#valid)| |dll_circular_append_#t~ret8.base|)))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4); {755#(exists ((node_create_~temp~0.offset Int) (dll_circular_append_~new_last~0.base Int)) (and (= (select |old(#valid)| dll_circular_append_~new_last~0.base) 0) (= |dll_circular_append_#t~mem9.base| (select (select (store |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)) |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|))))} is VALID [2018-11-14 19:13:19,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {755#(exists ((node_create_~temp~0.offset Int) (dll_circular_append_~new_last~0.base Int)) (and (= (select |old(#valid)| dll_circular_append_~new_last~0.base) 0) (= |dll_circular_append_#t~mem9.base| (select (select (store |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)) |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|))))} assume 0 == #t~mem9.base && 0 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 4, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~new_last~0.base, ~new_last~0.offset + 0, 4);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {759#(exists ((node_create_~temp~0.offset Int) (dll_circular_append_~new_last~0.base Int)) (and (= (select |old(#valid)| dll_circular_append_~new_last~0.base) 0) (= (select (select (store |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)) |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|) 0)))} is VALID [2018-11-14 19:13:19,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {759#(exists ((node_create_~temp~0.offset Int) (dll_circular_append_~new_last~0.base Int)) (and (= (select |old(#valid)| dll_circular_append_~new_last~0.base) 0) (= (select (select (store |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)) |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|) 0)))} assume true; {759#(exists ((node_create_~temp~0.offset Int) (dll_circular_append_~new_last~0.base Int)) (and (= (select |old(#valid)| dll_circular_append_~new_last~0.base) 0) (= (select (select (store |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)) |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|) 0)))} is VALID [2018-11-14 19:13:19,785 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {759#(exists ((node_create_~temp~0.offset Int) (dll_circular_append_~new_last~0.base Int)) (and (= (select |old(#valid)| dll_circular_append_~new_last~0.base) 0) (= (select (select (store |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base (store (store (select |old(#memory_$Pointer$.base)| dll_circular_append_~new_last~0.base) node_create_~temp~0.offset 0) (+ node_create_~temp~0.offset 4) 0)) |dll_circular_append_#in~head.base|) |dll_circular_append_#in~head.offset|) 0)))} {724#(and (exists ((|node_create_#t~malloc2.base| Int)) (and (not (= |node_create_#t~malloc2.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= 1 (select |#valid| |node_create_#t~malloc2.base|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_~#s~0.base|)) (= |main_~#s~0.offset| 0) (= (select |#valid| |main_~#s~0.base|) 1))} #131#return; {600#false} is VALID [2018-11-14 19:13:19,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {600#false} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset;~count~0 := 0; {600#false} is VALID [2018-11-14 19:13:19,786 INFO L273 TraceCheckUtils]: 45: Hoare triple {600#false} assume true;call #t~mem18 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {600#false} is VALID [2018-11-14 19:13:19,786 INFO L273 TraceCheckUtils]: 46: Hoare triple {600#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {600#false} is VALID [2018-11-14 19:13:19,786 INFO L273 TraceCheckUtils]: 47: Hoare triple {600#false} assume !false; {600#false} is VALID [2018-11-14 19:13:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 19:13:19,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:13:19,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-11-14 19:13:19,828 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-11-14 19:13:19,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:19,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 19:13:20,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:20,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 19:13:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 19:13:20,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1082, Unknown=2, NotChecked=0, Total=1190 [2018-11-14 19:13:20,344 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 35 states. [2018-11-14 19:13:23,067 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-11-14 19:13:36,277 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-14 19:13:44,313 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-14 19:13:48,481 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-11-14 19:13:50,337 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-14 19:13:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:51,901 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2018-11-14 19:13:51,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 19:13:51,902 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-11-14 19:13:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:13:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 99 transitions. [2018-11-14 19:13:51,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 19:13:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 99 transitions. [2018-11-14 19:13:51,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 99 transitions. [2018-11-14 19:13:52,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:52,092 INFO L225 Difference]: With dead ends: 83 [2018-11-14 19:13:52,093 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 19:13:52,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=186, Invalid=1792, Unknown=2, NotChecked=0, Total=1980 [2018-11-14 19:13:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 19:13:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2018-11-14 19:13:52,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:52,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 62 states. [2018-11-14 19:13:52,170 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 62 states. [2018-11-14 19:13:52,170 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 62 states. [2018-11-14 19:13:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:52,173 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-14 19:13:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-11-14 19:13:52,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:52,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:52,175 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 73 states. [2018-11-14 19:13:52,175 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 73 states. [2018-11-14 19:13:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:52,180 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-14 19:13:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-11-14 19:13:52,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:52,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:52,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:52,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 19:13:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-14 19:13:52,186 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 48 [2018-11-14 19:13:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:52,186 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-14 19:13:52,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 19:13:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-14 19:13:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 19:13:52,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:52,188 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] [2018-11-14 19:13:52,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:52,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -481907786, now seen corresponding path program 1 times [2018-11-14 19:13:52,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:52,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:52,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:53,687 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:13:53,693 INFO L168 Benchmark]: Toolchain (without parser) took 50041.89 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.2 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -107.8 MB). Peak memory consumption was 749.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:53,694 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:13:53,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.6 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:53,696 INFO L168 Benchmark]: Boogie Preprocessor took 130.08 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:53,697 INFO L168 Benchmark]: RCFGBuilder took 1232.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:53,697 INFO L168 Benchmark]: TraceAbstraction took 47975.20 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.8 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 568.2 MB). Peak memory consumption was 715.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:53,702 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 698.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 710.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.6 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.08 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1232.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47975.20 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.8 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 568.2 MB). Peak memory consumption was 715.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...