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_insert_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:13:03,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:13:03,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:13:03,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:13:03,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:13:03,495 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:13:03,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:13:03,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:13:03,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:13:03,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:13:03,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:13:03,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:13:03,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:13:03,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:13:03,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:13:03,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:13:03,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:13:03,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:13:03,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:13:03,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:13:03,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:13:03,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:13:03,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:13:03,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:13:03,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:13:03,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:13:03,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:13:03,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:13:03,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:13:03,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:13:03,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:13:03,525 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:13:03,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:13:03,525 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:13:03,526 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:13:03,527 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:13:03,528 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:03,542 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:13:03,543 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:13:03,543 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:13:03,544 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:13:03,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:13:03,544 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:13:03,545 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:13:03,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:13:03,545 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:13:03,545 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:13:03,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:13:03,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:13:03,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:13:03,546 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:13:03,546 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:13:03,546 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:13:03,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:13:03,547 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:13:03,547 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:13:03,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:13:03,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:13:03,548 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:13:03,548 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:13:03,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:13:03,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:13:03,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:13:03,549 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:13:03,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:13:03,549 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:13:03,549 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:13:03,549 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:13:03,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:13:03,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:13:03,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:13:03,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:13:03,614 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:13:03,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:13:03,673 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b747f0444/c8a6de83871748378417a1ddd126379e/FLAGd4f13d335 [2018-11-14 19:13:04,187 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:13:04,189 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:13:04,205 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b747f0444/c8a6de83871748378417a1ddd126379e/FLAGd4f13d335 [2018-11-14 19:13:04,220 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b747f0444/c8a6de83871748378417a1ddd126379e [2018-11-14 19:13:04,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:13:04,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:13:04,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:13:04,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:13:04,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:13:04,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e0752b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:04, skipping insertion in model container [2018-11-14 19:13:04,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:13:04" (1/1) ... [2018-11-14 19:13:04,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:13:04,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:13:04,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:13:04,795 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:13:04,907 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:13:05,124 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:13:05,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:05 WrapperNode [2018-11-14 19:13:05,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:13:05,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:13:05,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:13:05,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:13:05,142 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:05" (1/1) ... [2018-11-14 19:13:05,142 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:05" (1/1) ... [2018-11-14 19:13:05,169 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:05" (1/1) ... [2018-11-14 19:13:05,172 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:05" (1/1) ... [2018-11-14 19:13:05,232 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:05" (1/1) ... [2018-11-14 19:13:05,246 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:05" (1/1) ... [2018-11-14 19:13:05,255 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:05" (1/1) ... [2018-11-14 19:13:05,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:13:05,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:13:05,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:13:05,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:13:05,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:05" (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:05,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:13:05,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:13:05,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:13:05,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:13:05,338 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 19:13:05,339 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 19:13:05,339 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-14 19:13:05,339 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-14 19:13:05,339 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_insert [2018-11-14 19:13:05,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:13:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:13:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:13:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:13:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:13:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:13:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:13:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:13:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:13:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:13:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:13:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:13:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:13:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:13:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:13:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:13:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:13:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:13:05,343 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:13:05,344 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:13:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:13:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:13:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:13:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:13:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:13:05,345 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:13:05,346 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:13:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:13:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:13:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:13:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:13:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:13:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:13:05,349 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:13:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:13:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:13:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:13:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:13:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:13:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:13:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:13:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:13:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:13:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:13:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:13:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:13:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:13:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:13:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:13:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:13:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:13:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:13:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:13:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:13:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:13:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:13:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:13:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:13:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:13:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:13:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:13:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:13:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:13:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:13:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:13:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:13:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:13:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:13:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:13:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:13:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:13:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:13:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:13:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:13:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:13:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:13:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 19:13:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:13:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:13:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:13:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-14 19:13:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-14 19:13:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:13:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:13:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_insert [2018-11-14 19:13:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:13:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:13:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:13:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:13:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:13:06,760 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:13:06,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:13:06 BoogieIcfgContainer [2018-11-14 19:13:06,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:13:06,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:13:06,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:13:06,769 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:13:06,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:13:04" (1/3) ... [2018-11-14 19:13:06,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132bbc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:13:06, skipping insertion in model container [2018-11-14 19:13:06,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:13:05" (2/3) ... [2018-11-14 19:13:06,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132bbc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:13:06, skipping insertion in model container [2018-11-14 19:13:06,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:13:06" (3/3) ... [2018-11-14 19:13:06,775 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 19:13:06,788 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:13:06,802 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:13:06,825 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:13:06,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:13:06,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:13:06,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:13:06,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:13:06,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:13:06,878 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:13:06,878 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:13:06,878 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:13:06,878 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:13:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-14 19:13:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 19:13:06,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:06,926 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:06,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:06,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash 180157280, now seen corresponding path program 1 times [2018-11-14 19:13:06,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:06,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:07,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:07,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:07,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:07,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-14 19:13:07,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {63#true} is VALID [2018-11-14 19:13:07,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 19:13:07,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #151#return; {63#true} is VALID [2018-11-14 19:13:07,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret24 := main(); {63#true} is VALID [2018-11-14 19:13:07,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#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); {63#true} is VALID [2018-11-14 19:13:07,271 INFO L256 TraceCheckUtils]: 6: Hoare triple {63#true} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {63#true} is VALID [2018-11-14 19:13:07,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {63#true} ~len := #in~len;~data := #in~data; {63#true} is VALID [2018-11-14 19:13:07,272 INFO L256 TraceCheckUtils]: 8: Hoare triple {63#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {63#true} is VALID [2018-11-14 19:13:07,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {63#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; {63#true} is VALID [2018-11-14 19:13:07,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {63#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {63#true} is VALID [2018-11-14 19:13:07,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {63#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; {63#true} is VALID [2018-11-14 19:13:07,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 19:13:07,274 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {63#true} {63#true} #137#return; {63#true} is VALID [2018-11-14 19:13:07,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {63#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {63#true} is VALID [2018-11-14 19:13:07,287 INFO L273 TraceCheckUtils]: 15: Hoare triple {63#true} assume !true; {64#false} is VALID [2018-11-14 19:13:07,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#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; {64#false} is VALID [2018-11-14 19:13:07,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-14 19:13:07,289 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {64#false} {63#true} #143#return; {64#false} is VALID [2018-11-14 19:13:07,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {64#false} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret17.base, #t~ret17.offset; {64#false} is VALID [2018-11-14 19:13:07,289 INFO L256 TraceCheckUtils]: 20: Hoare triple {64#false} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && ~len~0 % 2 != 0 then ~len~0 / 2 + 1 else ~len~0 / 2)); {63#true} is VALID [2018-11-14 19:13:07,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {63#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {63#true} is VALID [2018-11-14 19:13:07,290 INFO L256 TraceCheckUtils]: 22: Hoare triple {63#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {63#true} is VALID [2018-11-14 19:13:07,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {63#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; {63#true} is VALID [2018-11-14 19:13:07,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {63#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {63#true} is VALID [2018-11-14 19:13:07,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {63#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; {63#true} is VALID [2018-11-14 19:13:07,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 19:13:07,292 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {63#true} {63#true} #149#return; {63#true} is VALID [2018-11-14 19:13:07,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {63#true} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {63#true} is VALID [2018-11-14 19:13:07,293 INFO L273 TraceCheckUtils]: 29: Hoare triple {63#true} assume !true; {63#true} is VALID [2018-11-14 19:13:07,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {63#true} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset + 0, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~new_node~0.offset + 4, 4);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset + 0, 4);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~1.base, ~last~1.offset + 4, 4); {63#true} is VALID [2018-11-14 19:13:07,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 19:13:07,294 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {63#true} {64#false} #145#return; {64#false} is VALID [2018-11-14 19:13:07,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {64#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0; {64#false} is VALID [2018-11-14 19:13:07,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {64#false} assume !true; {64#false} is VALID [2018-11-14 19:13:07,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {64#false} assume ~count~0 != 1 + ~len~0; {64#false} is VALID [2018-11-14 19:13:07,296 INFO L273 TraceCheckUtils]: 36: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-14 19:13:07,303 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:07,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:13:07,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:13:07,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 19:13:07,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:07,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:13:07,489 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:07,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:13:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:13:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:13:07,500 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-14 19:13:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:07,864 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2018-11-14 19:13:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:13:07,865 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 19:13:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:13:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 19:13:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:13:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 19:13:07,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 131 transitions. [2018-11-14 19:13:08,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:08,419 INFO L225 Difference]: With dead ends: 104 [2018-11-14 19:13:08,420 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 19:13:08,424 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:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 19:13:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 19:13:08,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:08,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 19:13:08,474 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 19:13:08,474 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 19:13:08,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:08,481 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 19:13:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 19:13:08,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:08,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:08,482 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 19:13:08,483 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 19:13:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:08,488 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-14 19:13:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 19:13:08,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:08,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:08,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:08,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:13:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-14 19:13:08,496 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 37 [2018-11-14 19:13:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:08,497 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-14 19:13:08,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:13:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-14 19:13:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:13:08,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:08,500 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:13:08,500 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:08,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1248325383, now seen corresponding path program 1 times [2018-11-14 19:13:08,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:08,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:08,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:08,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2018-11-14 19:13:08,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {352#true} is VALID [2018-11-14 19:13:08,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 19:13:08,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #151#return; {352#true} is VALID [2018-11-14 19:13:08,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret24 := main(); {352#true} is VALID [2018-11-14 19:13:08,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {352#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); {352#true} is VALID [2018-11-14 19:13:08,707 INFO L256 TraceCheckUtils]: 6: Hoare triple {352#true} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {352#true} is VALID [2018-11-14 19:13:08,707 INFO L273 TraceCheckUtils]: 7: Hoare triple {352#true} ~len := #in~len;~data := #in~data; {352#true} is VALID [2018-11-14 19:13:08,708 INFO L256 TraceCheckUtils]: 8: Hoare triple {352#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {352#true} is VALID [2018-11-14 19:13:08,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {352#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; {352#true} is VALID [2018-11-14 19:13:08,708 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {352#true} is VALID [2018-11-14 19:13:08,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#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; {352#true} is VALID [2018-11-14 19:13:08,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 19:13:08,709 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {352#true} {352#true} #137#return; {352#true} is VALID [2018-11-14 19:13:08,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#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; {352#true} is VALID [2018-11-14 19:13:08,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 19:13:08,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {352#true} assume !(~len > 1); {352#true} is VALID [2018-11-14 19:13:08,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {352#true} 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; {352#true} is VALID [2018-11-14 19:13:08,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 19:13:08,711 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {352#true} {352#true} #143#return; {352#true} is VALID [2018-11-14 19:13:08,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {352#true} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret17.base, #t~ret17.offset; {352#true} is VALID [2018-11-14 19:13:08,712 INFO L256 TraceCheckUtils]: 21: Hoare triple {352#true} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && ~len~0 % 2 != 0 then ~len~0 / 2 + 1 else ~len~0 / 2)); {352#true} is VALID [2018-11-14 19:13:08,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {352#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {352#true} is VALID [2018-11-14 19:13:08,713 INFO L256 TraceCheckUtils]: 23: Hoare triple {352#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {352#true} is VALID [2018-11-14 19:13:08,713 INFO L273 TraceCheckUtils]: 24: Hoare triple {352#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; {352#true} is VALID [2018-11-14 19:13:08,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {352#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {352#true} is VALID [2018-11-14 19:13:08,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {352#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; {352#true} is VALID [2018-11-14 19:13:08,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 19:13:08,714 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {352#true} {352#true} #149#return; {352#true} is VALID [2018-11-14 19:13:08,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {352#true} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {354#(and (= dll_circular_insert_~snd_to_last~0.offset 0) (= dll_circular_insert_~snd_to_last~0.base 0))} is VALID [2018-11-14 19:13:08,744 INFO L273 TraceCheckUtils]: 30: Hoare triple {354#(and (= dll_circular_insert_~snd_to_last~0.offset 0) (= dll_circular_insert_~snd_to_last~0.base 0))} assume true; {354#(and (= dll_circular_insert_~snd_to_last~0.offset 0) (= dll_circular_insert_~snd_to_last~0.base 0))} is VALID [2018-11-14 19:13:08,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {354#(and (= dll_circular_insert_~snd_to_last~0.offset 0) (= dll_circular_insert_~snd_to_last~0.base 0))} assume !(~index > 0); {354#(and (= dll_circular_insert_~snd_to_last~0.offset 0) (= dll_circular_insert_~snd_to_last~0.base 0))} is VALID [2018-11-14 19:13:08,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {354#(and (= dll_circular_insert_~snd_to_last~0.offset 0) (= dll_circular_insert_~snd_to_last~0.base 0))} assume ~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0;call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~snd_to_last~0.base, ~snd_to_last~0.offset + 0, 4);call write~$Pointer$(~snd_to_last~0.base, ~snd_to_last~0.offset, ~new_node~0.base, ~new_node~0.offset + 4, 4);call write~$Pointer$(~last~1.base, ~last~1.offset, ~new_node~0.base, ~new_node~0.offset + 0, 4);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~last~1.base, ~last~1.offset + 4, 4); {353#false} is VALID [2018-11-14 19:13:08,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {353#false} assume true; {353#false} is VALID [2018-11-14 19:13:08,751 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {353#false} {352#true} #145#return; {353#false} is VALID [2018-11-14 19:13:08,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {353#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0; {353#false} is VALID [2018-11-14 19:13:08,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {353#false} assume true;call #t~mem20 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {353#false} is VALID [2018-11-14 19:13:08,751 INFO L273 TraceCheckUtils]: 37: Hoare triple {353#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {353#false} is VALID [2018-11-14 19:13:08,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {353#false} assume !false; {353#false} is VALID [2018-11-14 19:13:08,758 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,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:13:08,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:13:08,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 19:13:08,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:08,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:13:08,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:08,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:13:08,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:13:08,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:13:08,849 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 3 states. [2018-11-14 19:13:09,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:09,032 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-14 19:13:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:13:09,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 19:13:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:13:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 19:13:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:13:09,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 19:13:09,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-14 19:13:09,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:09,219 INFO L225 Difference]: With dead ends: 59 [2018-11-14 19:13:09,219 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 19:13:09,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:13:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 19:13:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 19:13:09,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:09,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 19:13:09,241 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 19:13:09,241 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 19:13:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:09,247 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 19:13:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-14 19:13:09,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:09,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:09,248 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 19:13:09,249 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 19:13:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:09,253 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 19:13:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-14 19:13:09,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:09,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:09,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:09,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 19:13:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-11-14 19:13:09,258 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 39 [2018-11-14 19:13:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:09,259 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-14 19:13:09,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:13:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2018-11-14 19:13:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 19:13:09,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:09,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:13:09,261 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:09,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1678898253, now seen corresponding path program 1 times [2018-11-14 19:13:09,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:09,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:09,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:09,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:09,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2018-11-14 19:13:09,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {597#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {597#true} is VALID [2018-11-14 19:13:09,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:13:09,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #151#return; {597#true} is VALID [2018-11-14 19:13:09,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret24 := main(); {597#true} is VALID [2018-11-14 19:13:09,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {597#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); {599#(<= 2 main_~len~0)} is VALID [2018-11-14 19:13:09,465 INFO L256 TraceCheckUtils]: 6: Hoare triple {599#(<= 2 main_~len~0)} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {597#true} is VALID [2018-11-14 19:13:09,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {597#true} ~len := #in~len;~data := #in~data; {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:09,467 INFO L256 TraceCheckUtils]: 8: Hoare triple {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {597#true} is VALID [2018-11-14 19:13:09,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {597#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; {597#true} is VALID [2018-11-14 19:13:09,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {597#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {597#true} is VALID [2018-11-14 19:13:09,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {597#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; {597#true} is VALID [2018-11-14 19:13:09,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:13:09,470 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {597#true} {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} #137#return; {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:09,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#(<= |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; {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:09,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume true; {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} is VALID [2018-11-14 19:13:09,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#(<= |dll_circular_create_#in~len| dll_circular_create_~len)} assume !(~len > 1); {601#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 19:13:09,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {601#(<= |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; {601#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 19:13:09,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {601#(<= |dll_circular_create_#in~len| 1)} assume true; {601#(<= |dll_circular_create_#in~len| 1)} is VALID [2018-11-14 19:13:09,475 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {601#(<= |dll_circular_create_#in~len| 1)} {599#(<= 2 main_~len~0)} #143#return; {598#false} is VALID [2018-11-14 19:13:09,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {598#false} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret17.base, #t~ret17.offset; {598#false} is VALID [2018-11-14 19:13:09,476 INFO L256 TraceCheckUtils]: 21: Hoare triple {598#false} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && ~len~0 % 2 != 0 then ~len~0 / 2 + 1 else ~len~0 / 2)); {597#true} is VALID [2018-11-14 19:13:09,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {597#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {597#true} is VALID [2018-11-14 19:13:09,477 INFO L256 TraceCheckUtils]: 23: Hoare triple {597#true} call #t~ret8.base, #t~ret8.offset := node_create(~data); {597#true} is VALID [2018-11-14 19:13:09,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {597#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; {597#true} is VALID [2018-11-14 19:13:09,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {597#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {597#true} is VALID [2018-11-14 19:13:09,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {597#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; {597#true} is VALID [2018-11-14 19:13:09,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:13:09,478 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {597#true} {597#true} #149#return; {597#true} is VALID [2018-11-14 19:13:09,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {597#true} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {597#true} is VALID [2018-11-14 19:13:09,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:13:09,479 INFO L273 TraceCheckUtils]: 31: Hoare triple {597#true} assume !(~index > 0); {597#true} is VALID [2018-11-14 19:13:09,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {597#true} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4); {597#true} is VALID [2018-11-14 19:13:09,480 INFO L273 TraceCheckUtils]: 33: Hoare triple {597#true} assume #t~mem12.base != 0 || #t~mem12.offset != 0;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~new_node~0.base, ~new_node~0.offset + 0, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem14.base, #t~mem14.offset, ~new_node~0.base, ~new_node~0.offset + 4, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem15.base, #t~mem15.offset + 0, 4);havoc #t~mem15.base, #t~mem15.offset;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem16.base, #t~mem16.offset + 4, 4);havoc #t~mem16.base, #t~mem16.offset; {597#true} is VALID [2018-11-14 19:13:09,480 INFO L273 TraceCheckUtils]: 34: Hoare triple {597#true} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {597#true} is VALID [2018-11-14 19:13:09,481 INFO L273 TraceCheckUtils]: 35: Hoare triple {597#true} assume true; {597#true} is VALID [2018-11-14 19:13:09,481 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {597#true} {598#false} #145#return; {598#false} is VALID [2018-11-14 19:13:09,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {598#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0; {598#false} is VALID [2018-11-14 19:13:09,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {598#false} assume true;call #t~mem20 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {598#false} is VALID [2018-11-14 19:13:09,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {598#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {598#false} is VALID [2018-11-14 19:13:09,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {598#false} assume !false; {598#false} is VALID [2018-11-14 19:13:09,493 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:09,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:13:09,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:13:09,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-14 19:13:09,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:09,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:13:09,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:09,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:13:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:13:09,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:13:09,605 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 5 states. [2018-11-14 19:13:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:09,941 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-14 19:13:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:13:09,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-14 19:13:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:13:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-14 19:13:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:13:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2018-11-14 19:13:09,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2018-11-14 19:13:10,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:10,100 INFO L225 Difference]: With dead ends: 84 [2018-11-14 19:13:10,101 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 19:13:10,101 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:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 19:13:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-14 19:13:10,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:10,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 49 states. [2018-11-14 19:13:10,141 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 49 states. [2018-11-14 19:13:10,141 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 49 states. [2018-11-14 19:13:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:10,145 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-14 19:13:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-14 19:13:10,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:10,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:10,147 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 53 states. [2018-11-14 19:13:10,147 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 53 states. [2018-11-14 19:13:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:10,151 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-14 19:13:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2018-11-14 19:13:10,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:10,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:10,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:10,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 19:13:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-11-14 19:13:10,156 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 41 [2018-11-14 19:13:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:10,157 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-14 19:13:10,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:13:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-14 19:13:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 19:13:10,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:10,159 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:13:10,160 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:10,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:10,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1614910049, now seen corresponding path program 1 times [2018-11-14 19:13:10,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:10,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:10,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:10,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {890#true} call ULTIMATE.init(); {890#true} is VALID [2018-11-14 19:13:10,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {890#true} is VALID [2018-11-14 19:13:10,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {890#true} {890#true} #151#return; {890#true} is VALID [2018-11-14 19:13:10,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {890#true} call #t~ret24 := main(); {890#true} is VALID [2018-11-14 19:13:10,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {890#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); {892#(<= 2 main_~len~0)} is VALID [2018-11-14 19:13:10,399 INFO L256 TraceCheckUtils]: 6: Hoare triple {892#(<= 2 main_~len~0)} call #t~ret17.base, #t~ret17.offset := dll_circular_create(~len~0, ~data~0); {890#true} is VALID [2018-11-14 19:13:10,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {890#true} ~len := #in~len;~data := #in~data; {890#true} is VALID [2018-11-14 19:13:10,399 INFO L256 TraceCheckUtils]: 8: Hoare triple {890#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {890#true} is VALID [2018-11-14 19:13:10,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {890#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {890#true} is VALID [2018-11-14 19:13:10,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,401 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {890#true} {890#true} #137#return; {890#true} is VALID [2018-11-14 19:13:10,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,401 INFO L273 TraceCheckUtils]: 16: Hoare triple {890#true} assume !!(~len > 1); {890#true} is VALID [2018-11-14 19:13:10,402 INFO L256 TraceCheckUtils]: 17: Hoare triple {890#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {890#true} is VALID [2018-11-14 19:13:10,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,402 INFO L273 TraceCheckUtils]: 19: Hoare triple {890#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {890#true} is VALID [2018-11-14 19:13:10,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,403 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {890#true} {890#true} #139#return; {890#true} is VALID [2018-11-14 19:13:10,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {890#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset + 0, 4); {890#true} is VALID [2018-11-14 19:13:10,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {890#true} 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); {890#true} is VALID [2018-11-14 19:13:10,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {890#true} ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := #t~post5 - 1;havoc #t~post5; {890#true} is VALID [2018-11-14 19:13:10,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {890#true} assume !(~len > 1); {890#true} is VALID [2018-11-14 19:13:10,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {890#true} 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; {890#true} is VALID [2018-11-14 19:13:10,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,415 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {890#true} {892#(<= 2 main_~len~0)} #143#return; {892#(<= 2 main_~len~0)} is VALID [2018-11-14 19:13:10,416 INFO L273 TraceCheckUtils]: 31: Hoare triple {892#(<= 2 main_~len~0)} call write~$Pointer$(#t~ret17.base, #t~ret17.offset, ~#s~0.base, ~#s~0.offset, 4);havoc #t~ret17.base, #t~ret17.offset; {892#(<= 2 main_~len~0)} is VALID [2018-11-14 19:13:10,416 INFO L256 TraceCheckUtils]: 32: Hoare triple {892#(<= 2 main_~len~0)} call dll_circular_insert(~#s~0.base, ~#s~0.offset, ~data~0, (if ~len~0 < 0 && ~len~0 % 2 != 0 then ~len~0 / 2 + 1 else ~len~0 / 2)); {890#true} is VALID [2018-11-14 19:13:10,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {890#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} is VALID [2018-11-14 19:13:10,417 INFO L256 TraceCheckUtils]: 34: Hoare triple {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} call #t~ret8.base, #t~ret8.offset := node_create(~data); {890#true} is VALID [2018-11-14 19:13:10,417 INFO L273 TraceCheckUtils]: 35: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {890#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {890#true} is VALID [2018-11-14 19:13:10,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {890#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; {890#true} is VALID [2018-11-14 19:13:10,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {890#true} assume true; {890#true} is VALID [2018-11-14 19:13:10,419 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {890#true} {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} #149#return; {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} is VALID [2018-11-14 19:13:10,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} ~new_node~0.base, ~new_node~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~snd_to_last~0.base, ~snd_to_last~0.offset := 0, 0;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~last~1.base, ~last~1.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} is VALID [2018-11-14 19:13:10,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} assume true; {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} is VALID [2018-11-14 19:13:10,422 INFO L273 TraceCheckUtils]: 42: Hoare triple {893#(= dll_circular_insert_~index |dll_circular_insert_#in~index|)} assume !(~index > 0); {894#(<= |dll_circular_insert_#in~index| 0)} is VALID [2018-11-14 19:13:10,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {894#(<= |dll_circular_insert_#in~index| 0)} assume !(~snd_to_last~0.base != 0 || ~snd_to_last~0.offset != 0);call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~head.base, ~head.offset, 4); {894#(<= |dll_circular_insert_#in~index| 0)} is VALID [2018-11-14 19:13:10,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {894#(<= |dll_circular_insert_#in~index| 0)} assume #t~mem12.base != 0 || #t~mem12.offset != 0;havoc #t~mem12.base, #t~mem12.offset;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem13.base, #t~mem13.offset, ~new_node~0.base, ~new_node~0.offset + 0, 4);havoc #t~mem13.base, #t~mem13.offset;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(#t~mem14.base, #t~mem14.offset, ~new_node~0.base, ~new_node~0.offset + 4, 4);havoc #t~mem14.base, #t~mem14.offset;call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem15.base, #t~mem15.offset + 0, 4);havoc #t~mem15.base, #t~mem15.offset;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~head.base, ~head.offset, 4);call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, #t~mem16.base, #t~mem16.offset + 4, 4);havoc #t~mem16.base, #t~mem16.offset; {894#(<= |dll_circular_insert_#in~index| 0)} is VALID [2018-11-14 19:13:10,434 INFO L273 TraceCheckUtils]: 45: Hoare triple {894#(<= |dll_circular_insert_#in~index| 0)} call write~$Pointer$(~new_node~0.base, ~new_node~0.offset, ~head.base, ~head.offset, 4); {894#(<= |dll_circular_insert_#in~index| 0)} is VALID [2018-11-14 19:13:10,435 INFO L273 TraceCheckUtils]: 46: Hoare triple {894#(<= |dll_circular_insert_#in~index| 0)} assume true; {894#(<= |dll_circular_insert_#in~index| 0)} is VALID [2018-11-14 19:13:10,438 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {894#(<= |dll_circular_insert_#in~index| 0)} {892#(<= 2 main_~len~0)} #145#return; {891#false} is VALID [2018-11-14 19:13:10,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {891#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem18.base, #t~mem18.offset;havoc #t~mem18.base, #t~mem18.offset;~count~0 := 0; {891#false} is VALID [2018-11-14 19:13:10,439 INFO L273 TraceCheckUtils]: 49: Hoare triple {891#false} assume true;call #t~mem20 := read~int(~ptr~0.base, ~ptr~0.offset + 8, 4); {891#false} is VALID [2018-11-14 19:13:10,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {891#false} assume ~data~0 != #t~mem20;havoc #t~mem20; {891#false} is VALID [2018-11-14 19:13:10,439 INFO L273 TraceCheckUtils]: 51: Hoare triple {891#false} assume !false; {891#false} is VALID [2018-11-14 19:13:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-14 19:13:10,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:13:10,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:13:10,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 19:13:10,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:13:10,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:13:10,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:10,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:13:10,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:13:10,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:13:10,574 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 5 states. [2018-11-14 19:13:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:10,960 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-14 19:13:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:13:10,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 19:13:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:13:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:13:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 19:13:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:13:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-14 19:13:10,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-14 19:13:11,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:13:11,107 INFO L225 Difference]: With dead ends: 61 [2018-11-14 19:13:11,107 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 19:13:11,107 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:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 19:13:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 19:13:11,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:13:11,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 19:13:11,131 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 19:13:11,131 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 19:13:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:11,135 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 19:13:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 19:13:11,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:11,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:11,136 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 19:13:11,136 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 19:13:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:13:11,139 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 19:13:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 19:13:11,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:13:11,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:13:11,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:13:11,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:13:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 19:13:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-14 19:13:11,144 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 52 [2018-11-14 19:13:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:13:11,144 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-14 19:13:11,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:13:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 19:13:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 19:13:11,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:13:11,146 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:13:11,147 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:13:11,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:13:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1242292531, now seen corresponding path program 1 times [2018-11-14 19:13:11,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:13:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:13:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:11,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:13:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:13:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:13:12,699 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-11-14 19:13:12,997 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:13,003 INFO L168 Benchmark]: Toolchain (without parser) took 8772.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -223.8 MB). Peak memory consumption was 542.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:13,004 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:13:13,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 893.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -823.3 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:13,006 INFO L168 Benchmark]: Boogie Preprocessor took 143.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:13,007 INFO L168 Benchmark]: RCFGBuilder took 1492.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:13,007 INFO L168 Benchmark]: TraceAbstraction took 6236.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 506.5 MB). Peak memory consumption was 506.5 MB. Max. memory is 7.1 GB. [2018-11-14 19:13:13,012 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 893.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.5 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -823.3 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1492.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6236.33 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 506.5 MB). Peak memory consumption was 506.5 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...