/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 13:29:02,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 13:29:02,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 13:29:02,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 13:29:02,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 13:29:02,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 13:29:02,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 13:29:02,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 13:29:02,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 13:29:02,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 13:29:02,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 13:29:02,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 13:29:02,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 13:29:02,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 13:29:02,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 13:29:02,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 13:29:02,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 13:29:02,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 13:29:02,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 13:29:02,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 13:29:02,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 13:29:02,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 13:29:02,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 13:29:02,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 13:29:02,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 13:29:02,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 13:29:02,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 13:29:02,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 13:29:02,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 13:29:02,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 13:29:02,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 13:29:02,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 13:29:02,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 13:29:02,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 13:29:02,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 13:29:02,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 13:29:02,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 13:29:02,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 13:29:02,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 13:29:02,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 13:29:02,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 13:29:02,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 13:29:02,370 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 13:29:02,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 13:29:02,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 13:29:02,375 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 13:29:02,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 13:29:02,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 13:29:02,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 13:29:02,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 13:29:02,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 13:29:02,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 13:29:02,377 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 13:29:02,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 13:29:02,377 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 13:29:02,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 13:29:02,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 13:29:02,378 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 13:29:02,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 13:29:02,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 13:29:02,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:29:02,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 13:29:02,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 13:29:02,380 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 13:29:02,380 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-17 13:29:02,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 13:29:02,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 13:29:02,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 13:29:02,680 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 13:29:02,680 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 13:29:02,681 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-07-17 13:29:02,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256d9b79e/745142ace2514c1c92ee7fdb62a1a82a/FLAG3c63f6f0a [2020-07-17 13:29:03,258 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 13:29:03,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2020-07-17 13:29:03,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256d9b79e/745142ace2514c1c92ee7fdb62a1a82a/FLAG3c63f6f0a [2020-07-17 13:29:03,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256d9b79e/745142ace2514c1c92ee7fdb62a1a82a [2020-07-17 13:29:03,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 13:29:03,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 13:29:03,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 13:29:03,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 13:29:03,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 13:29:03,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:29:03" (1/1) ... [2020-07-17 13:29:03,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50329135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:03, skipping insertion in model container [2020-07-17 13:29:03,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:29:03" (1/1) ... [2020-07-17 13:29:03,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 13:29:03,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 13:29:04,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:29:04,235 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 13:29:04,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:29:04,329 INFO L208 MainTranslator]: Completed translation [2020-07-17 13:29:04,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04 WrapperNode [2020-07-17 13:29:04,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 13:29:04,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 13:29:04,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 13:29:04,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 13:29:04,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... [2020-07-17 13:29:04,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 13:29:04,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 13:29:04,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 13:29:04,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 13:29:04,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:29:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 13:29:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 13:29:04,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-17 13:29:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-07-17 13:29:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-07-17 13:29:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-07-17 13:29:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-07-17 13:29:04,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 13:29:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 13:29:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-17 13:29:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-07-17 13:29:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-07-17 13:29:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-07-17 13:29:04,455 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-07-17 13:29:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-07-17 13:29:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-07-17 13:29:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-07-17 13:29:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-07-17 13:29:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-07-17 13:29:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-07-17 13:29:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-07-17 13:29:04,457 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-07-17 13:29:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-07-17 13:29:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-07-17 13:29:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-07-17 13:29:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-07-17 13:29:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-07-17 13:29:04,458 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-07-17 13:29:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-07-17 13:29:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-07-17 13:29:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-07-17 13:29:04,459 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-07-17 13:29:04,461 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-07-17 13:29:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-07-17 13:29:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-07-17 13:29:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-07-17 13:29:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-07-17 13:29:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-07-17 13:29:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-07-17 13:29:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-07-17 13:29:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-07-17 13:29:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-07-17 13:29:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-07-17 13:29:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-07-17 13:29:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-07-17 13:29:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-07-17 13:29:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-07-17 13:29:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-07-17 13:29:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-07-17 13:29:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-07-17 13:29:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-07-17 13:29:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-07-17 13:29:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-07-17 13:29:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-07-17 13:29:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-07-17 13:29:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-07-17 13:29:04,469 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-07-17 13:29:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-07-17 13:29:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-07-17 13:29:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-07-17 13:29:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-07-17 13:29:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-07-17 13:29:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-07-17 13:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-07-17 13:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-07-17 13:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-07-17 13:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-07-17 13:29:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-07-17 13:29:04,472 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-07-17 13:29:04,472 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-07-17 13:29:04,473 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-07-17 13:29:04,473 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-07-17 13:29:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-07-17 13:29:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-07-17 13:29:04,474 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-07-17 13:29:04,475 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-07-17 13:29:04,476 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-07-17 13:29:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-07-17 13:29:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-07-17 13:29:04,477 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-07-17 13:29:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-07-17 13:29:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-07-17 13:29:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-07-17 13:29:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-07-17 13:29:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-07-17 13:29:04,478 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-07-17 13:29:04,479 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-07-17 13:29:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 13:29:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 13:29:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 13:29:04,480 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 13:29:04,481 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 13:29:04,481 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-07-17 13:29:04,481 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 13:29:04,481 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-07-17 13:29:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-07-17 13:29:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-07-17 13:29:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-07-17 13:29:04,482 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-07-17 13:29:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-07-17 13:29:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-07-17 13:29:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-07-17 13:29:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-07-17 13:29:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-07-17 13:29:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-07-17 13:29:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 13:29:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-07-17 13:29:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-07-17 13:29:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-07-17 13:29:04,486 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-07-17 13:29:04,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 13:29:04,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 13:29:04,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 13:29:04,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-17 13:29:04,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 13:29:04,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 13:29:04,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 13:29:04,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 13:29:04,998 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 13:29:04,999 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 13:29:05,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:29:05 BoogieIcfgContainer [2020-07-17 13:29:05,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 13:29:05,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 13:29:05,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 13:29:05,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 13:29:05,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 01:29:03" (1/3) ... [2020-07-17 13:29:05,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215e4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:29:05, skipping insertion in model container [2020-07-17 13:29:05,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:29:04" (2/3) ... [2020-07-17 13:29:05,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215e4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:29:05, skipping insertion in model container [2020-07-17 13:29:05,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:29:05" (3/3) ... [2020-07-17 13:29:05,011 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2020-07-17 13:29:05,022 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 13:29:05,029 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 13:29:05,042 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 13:29:05,060 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 13:29:05,060 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 13:29:05,060 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-17 13:29:05,061 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 13:29:05,061 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 13:29:05,061 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 13:29:05,061 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 13:29:05,062 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 13:29:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2020-07-17 13:29:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 13:29:05,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:05,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:05,088 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:05,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1653885127, now seen corresponding path program 1 times [2020-07-17 13:29:05,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:05,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [147359011] [2020-07-17 13:29:05,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 13:29:05,433 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:05,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [147359011] [2020-07-17 13:29:05,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:05,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 13:29:05,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345453671] [2020-07-17 13:29:05,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 13:29:05,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:05,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 13:29:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 13:29:05,463 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 7 states. [2020-07-17 13:29:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:05,912 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2020-07-17 13:29:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 13:29:05,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-17 13:29:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:05,926 INFO L225 Difference]: With dead ends: 126 [2020-07-17 13:29:05,926 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 13:29:05,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-07-17 13:29:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 13:29:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2020-07-17 13:29:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-17 13:29:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2020-07-17 13:29:05,988 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 21 [2020-07-17 13:29:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:05,989 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2020-07-17 13:29:05,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 13:29:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2020-07-17 13:29:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-17 13:29:05,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:05,993 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:05,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 13:29:05,993 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1154270079, now seen corresponding path program 1 times [2020-07-17 13:29:05,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:05,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900118569] [2020-07-17 13:29:05,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 13:29:06,438 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:06,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900118569] [2020-07-17 13:29:06,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:06,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-17 13:29:06,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152774672] [2020-07-17 13:29:06,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 13:29:06,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 13:29:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-17 13:29:06,442 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 9 states. [2020-07-17 13:29:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:06,739 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-17 13:29:06,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 13:29:06,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-07-17 13:29:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:06,742 INFO L225 Difference]: With dead ends: 100 [2020-07-17 13:29:06,742 INFO L226 Difference]: Without dead ends: 72 [2020-07-17 13:29:06,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-17 13:29:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-17 13:29:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2020-07-17 13:29:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-17 13:29:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2020-07-17 13:29:06,763 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 61 [2020-07-17 13:29:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:06,764 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2020-07-17 13:29:06,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 13:29:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-07-17 13:29:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-17 13:29:06,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:06,766 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:06,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 13:29:06,767 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1531514875, now seen corresponding path program 1 times [2020-07-17 13:29:06,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:06,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543846253] [2020-07-17 13:29:06,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 13:29:07,178 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:07,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543846253] [2020-07-17 13:29:07,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:07,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-17 13:29:07,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529963532] [2020-07-17 13:29:07,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 13:29:07,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 13:29:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-07-17 13:29:07,181 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 17 states. [2020-07-17 13:29:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:08,486 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2020-07-17 13:29:08,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-17 13:29:08,489 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-17 13:29:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:08,492 INFO L225 Difference]: With dead ends: 121 [2020-07-17 13:29:08,492 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 13:29:08,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-07-17 13:29:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 13:29:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2020-07-17 13:29:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-17 13:29:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-07-17 13:29:08,539 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 61 [2020-07-17 13:29:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:08,542 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-07-17 13:29:08,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 13:29:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-07-17 13:29:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-17 13:29:08,545 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:08,545 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:08,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 13:29:08,546 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:08,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:08,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1994405374, now seen corresponding path program 1 times [2020-07-17 13:29:08,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:08,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048332838] [2020-07-17 13:29:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 13:29:08,715 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:08,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048332838] [2020-07-17 13:29:08,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:08,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-17 13:29:08,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802423193] [2020-07-17 13:29:08,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 13:29:08,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 13:29:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-17 13:29:08,717 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 9 states. [2020-07-17 13:29:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:08,996 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-07-17 13:29:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 13:29:08,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-07-17 13:29:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:08,999 INFO L225 Difference]: With dead ends: 134 [2020-07-17 13:29:08,999 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 13:29:09,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-17 13:29:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 13:29:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2020-07-17 13:29:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 13:29:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-07-17 13:29:09,018 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 61 [2020-07-17 13:29:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:09,019 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-07-17 13:29:09,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 13:29:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-07-17 13:29:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-17 13:29:09,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:09,020 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:09,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 13:29:09,021 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:09,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824736, now seen corresponding path program 1 times [2020-07-17 13:29:09,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:09,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099417396] [2020-07-17 13:29:09,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 13:29:09,348 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:09,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099417396] [2020-07-17 13:29:09,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:09,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-17 13:29:09,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011774315] [2020-07-17 13:29:09,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 13:29:09,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:09,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 13:29:09,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-07-17 13:29:09,351 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 18 states. [2020-07-17 13:29:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:10,310 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2020-07-17 13:29:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 13:29:10,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2020-07-17 13:29:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:10,312 INFO L225 Difference]: With dead ends: 89 [2020-07-17 13:29:10,312 INFO L226 Difference]: Without dead ends: 86 [2020-07-17 13:29:10,314 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 13:29:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-17 13:29:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2020-07-17 13:29:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 13:29:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2020-07-17 13:29:10,330 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 70 [2020-07-17 13:29:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:10,331 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2020-07-17 13:29:10,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 13:29:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2020-07-17 13:29:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-17 13:29:10,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:10,332 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:10,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 13:29:10,333 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2039706158, now seen corresponding path program 1 times [2020-07-17 13:29:10,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:10,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006940057] [2020-07-17 13:29:10,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 13:29:10,760 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:10,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1006940057] [2020-07-17 13:29:10,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:10,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-07-17 13:29:10,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291556162] [2020-07-17 13:29:10,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 13:29:10,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:10,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 13:29:10,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-07-17 13:29:10,768 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 23 states. [2020-07-17 13:29:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:12,074 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2020-07-17 13:29:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 13:29:12,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2020-07-17 13:29:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:12,077 INFO L225 Difference]: With dead ends: 93 [2020-07-17 13:29:12,077 INFO L226 Difference]: Without dead ends: 85 [2020-07-17 13:29:12,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-07-17 13:29:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-17 13:29:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2020-07-17 13:29:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 13:29:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-07-17 13:29:12,095 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 71 [2020-07-17 13:29:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:12,095 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-07-17 13:29:12,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 13:29:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-17 13:29:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-17 13:29:12,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:12,097 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:12,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 13:29:12,098 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:12,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:12,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2033290459, now seen corresponding path program 1 times [2020-07-17 13:29:12,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:12,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681154660] [2020-07-17 13:29:12,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 13:29:12,501 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:12,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681154660] [2020-07-17 13:29:12,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:12,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-07-17 13:29:12,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054291564] [2020-07-17 13:29:12,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-17 13:29:12,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-17 13:29:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-07-17 13:29:12,504 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 24 states. [2020-07-17 13:29:13,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:13,732 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2020-07-17 13:29:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 13:29:13,732 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2020-07-17 13:29:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:13,735 INFO L225 Difference]: With dead ends: 89 [2020-07-17 13:29:13,735 INFO L226 Difference]: Without dead ends: 82 [2020-07-17 13:29:13,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-07-17 13:29:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-17 13:29:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-07-17 13:29:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-17 13:29:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2020-07-17 13:29:13,751 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 85 [2020-07-17 13:29:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:13,752 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2020-07-17 13:29:13,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-17 13:29:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-07-17 13:29:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-07-17 13:29:13,754 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:13,754 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:13,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 13:29:13,755 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 571953633, now seen corresponding path program 2 times [2020-07-17 13:29:13,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:13,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [569239339] [2020-07-17 13:29:13,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 13:29:14,057 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:14,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [569239339] [2020-07-17 13:29:14,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:14,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-17 13:29:14,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851463330] [2020-07-17 13:29:14,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 13:29:14,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:14,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 13:29:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-17 13:29:14,060 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 13 states. [2020-07-17 13:29:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:14,528 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2020-07-17 13:29:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 13:29:14,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2020-07-17 13:29:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:14,531 INFO L225 Difference]: With dead ends: 89 [2020-07-17 13:29:14,531 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 13:29:14,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2020-07-17 13:29:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 13:29:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2020-07-17 13:29:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 13:29:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2020-07-17 13:29:14,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 85 [2020-07-17 13:29:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:14,549 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2020-07-17 13:29:14,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 13:29:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2020-07-17 13:29:14,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-17 13:29:14,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:14,551 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:14,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 13:29:14,551 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:14,551 INFO L82 PathProgramCache]: Analyzing trace with hash 578402155, now seen corresponding path program 1 times [2020-07-17 13:29:14,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:14,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49424854] [2020-07-17 13:29:14,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 13:29:15,020 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:15,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [49424854] [2020-07-17 13:29:15,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:15,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-17 13:29:15,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993542520] [2020-07-17 13:29:15,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-17 13:29:15,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:15,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-17 13:29:15,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2020-07-17 13:29:15,023 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 26 states. [2020-07-17 13:29:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:16,239 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-07-17 13:29:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 13:29:16,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2020-07-17 13:29:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:16,241 INFO L225 Difference]: With dead ends: 87 [2020-07-17 13:29:16,241 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 13:29:16,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2020-07-17 13:29:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 13:29:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 13:29:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 13:29:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-07-17 13:29:16,256 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 86 [2020-07-17 13:29:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:16,256 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-07-17 13:29:16,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-17 13:29:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-07-17 13:29:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-17 13:29:16,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:29:16,258 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:29:16,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 13:29:16,259 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:29:16,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:29:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1773366491, now seen corresponding path program 2 times [2020-07-17 13:29:16,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:29:16,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1620227617] [2020-07-17 13:29:16,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:29:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:29:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 13:29:16,594 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:29:16,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1620227617] [2020-07-17 13:29:16,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:29:16,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-17 13:29:16,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251140859] [2020-07-17 13:29:16,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 13:29:16,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:29:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 13:29:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-07-17 13:29:16,597 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 19 states. [2020-07-17 13:29:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:29:17,588 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-17 13:29:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 13:29:17,589 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2020-07-17 13:29:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:29:17,589 INFO L225 Difference]: With dead ends: 78 [2020-07-17 13:29:17,589 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 13:29:17,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2020-07-17 13:29:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 13:29:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 13:29:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 13:29:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 13:29:17,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2020-07-17 13:29:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:29:17,592 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 13:29:17,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 13:29:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 13:29:17,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 13:29:17,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 13:29:17,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 13:29:18,832 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-07-17 13:29:18,968 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-07-17 13:29:19,495 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2020-07-17 13:29:19,621 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2020-07-17 13:29:19,795 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-07-17 13:29:20,086 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-07-17 13:29:20,528 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2020-07-17 13:29:20,828 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-07-17 13:29:21,049 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 36 [2020-07-17 13:29:21,276 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-07-17 13:29:21,584 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-07-17 13:29:21,714 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2020-07-17 13:29:21,893 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-07-17 13:29:22,105 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-07-17 13:29:22,756 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2020-07-17 13:29:23,041 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2020-07-17 13:29:23,046 INFO L264 CegarLoopResult]: At program point my_mallocFINAL(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= 8 |my_malloc_#in~size|))) (.cse4 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse2 (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or .cse0 .cse4))) (.cse3 (not (= 0 ~elem~0.offset)))) (and (or .cse0 (= 8 my_malloc_~size)) (or (and (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|)) .cse2 .cse3 (and (<= |my_malloc_#res.base| 0) (<= |my_malloc_#res.offset| 0) (<= 0 |my_malloc_#res.base|) (<= 0 |my_malloc_#res.offset|))) (or (<= .cse1 ~guard_malloc_counter~0.offset) .cse2 .cse4 .cse3)))) [2020-07-17 13:29:23,046 INFO L264 CegarLoopResult]: At program point L879(line 879) the Hoare annotation is: (or (not (= 8 |my_malloc_#in~size|)) (and (= 8 my_malloc_~size) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|))) [2020-07-17 13:29:23,047 INFO L264 CegarLoopResult]: At program point L879-1(line 879) the Hoare annotation is: (let ((.cse0 (not (= 8 |my_malloc_#in~size|))) (.cse4 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)))) (let ((.cse2 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse1 (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or .cse0 .cse4))) (.cse3 (not (= 0 ~elem~0.offset)))) (and (or .cse0 (= 8 my_malloc_~size)) (or (and (<= |my_malloc_#t~ret30.offset| 0) (<= 0 |my_malloc_#t~ret30.offset|) (<= 0 |my_malloc_#t~ret30.base|) (<= |my_malloc_#t~ret30.base| 0)) .cse1 (and (<= .cse2 |my_malloc_#t~ret30.offset|) (<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset)) .cse3) (or (<= .cse2 ~guard_malloc_counter~0.offset) .cse1 .cse4 .cse3)))) [2020-07-17 13:29:23,047 INFO L264 CegarLoopResult]: At program point L879-2(line 879) the Hoare annotation is: (let ((.cse3 (not (= 8 |my_malloc_#in~size|))) (.cse4 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)))) (let ((.cse2 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse0 (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse3) (or .cse3 .cse4))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (and (<= |my_malloc_#res.base| 0) (<= |my_malloc_#res.offset| 0) (<= 0 |my_malloc_#res.base|) (<= |my_malloc_#t~ret30.offset| 0) (<= 0 |my_malloc_#res.offset|) (<= 0 |my_malloc_#t~ret30.offset|) (<= 0 |my_malloc_#t~ret30.base|) (<= |my_malloc_#t~ret30.base| 0)) .cse0 .cse1 (and (<= .cse2 |my_malloc_#t~ret30.offset|) (<= |my_malloc_#t~ret30.offset| ~guard_malloc_counter~0.offset) (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse2 |my_malloc_#res.offset|))) (or .cse3 (= 8 my_malloc_~size)) (or (<= .cse2 ~guard_malloc_counter~0.offset) .cse0 .cse4 .cse1)))) [2020-07-17 13:29:23,047 INFO L264 CegarLoopResult]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (or (not (= 8 |my_malloc_#in~size|)) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|))) [2020-07-17 13:29:23,047 INFO L264 CegarLoopResult]: At program point my_mallocEXIT(lines 878 880) the Hoare annotation is: (let ((.cse0 (not (= 8 |my_malloc_#in~size|))) (.cse4 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)))) (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse2 (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0) (or .cse0 .cse4))) (.cse3 (not (= 0 ~elem~0.offset)))) (and (or .cse0 (= 8 my_malloc_~size)) (or (and (<= |my_malloc_#res.offset| ~guard_malloc_counter~0.offset) (<= .cse1 |my_malloc_#res.offset|)) .cse2 .cse3 (and (<= |my_malloc_#res.base| 0) (<= |my_malloc_#res.offset| 0) (<= 0 |my_malloc_#res.base|) (<= 0 |my_malloc_#res.offset|))) (or (<= .cse1 ~guard_malloc_counter~0.offset) .cse2 .cse4 .cse3)))) [2020-07-17 13:29:23,047 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) [2020-07-17 13:29:23,048 INFO L264 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: (and (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) [2020-07-17 13:29:23,048 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 900) the Hoare annotation is: (and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,048 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= ~elem~0.base |old(~elem~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) [2020-07-17 13:29:23,048 INFO L264 CegarLoopResult]: At program point L887(line 887) the Hoare annotation is: (and (= ~elem~0.base |old(~elem~0.base)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,048 INFO L264 CegarLoopResult]: At program point L900(line 900) the Hoare annotation is: (and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,048 INFO L264 CegarLoopResult]: At program point L867(line 867) the Hoare annotation is: (and (= ~elem~0.base |old(~elem~0.base)|) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~elem~0.offset |old(~elem~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) [2020-07-17 13:29:23,049 INFO L264 CegarLoopResult]: At program point L900-1(line 900) the Hoare annotation is: (and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,049 INFO L264 CegarLoopResult]: At program point L900-2(line 900) the Hoare annotation is: (and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,049 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,049 INFO L264 CegarLoopResult]: At program point L897(line 897) the Hoare annotation is: (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= |old(~elem~0.base)| ~elem~0.base) (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)) [2020-07-17 13:29:23,049 INFO L264 CegarLoopResult]: At program point L896(lines 896 897) the Hoare annotation is: (and (= list_del_~entry.base |list_del_#in~entry.base|) (= |old(~elem~0.offset)| ~elem~0.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset) (= |old(~elem~0.base)| ~elem~0.base)) [2020-07-17 13:29:23,049 INFO L264 CegarLoopResult]: At program point L896-2(lines 895 898) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)))) (and (or .cse0 (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)) (or .cse0 (= 0 ~elem~0.offset) (not (<= 1 ~guard_malloc_counter~0.offset))))) [2020-07-17 13:29:23,050 INFO L264 CegarLoopResult]: At program point list_delEXIT(lines 895 898) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)))) (and (or .cse0 (= |old(~elem~0.offset)| |list_del_#in~entry.offset|)) (or .cse0 (= 0 ~elem~0.offset) (not (<= 1 ~guard_malloc_counter~0.offset))))) [2020-07-17 13:29:23,050 INFO L264 CegarLoopResult]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)) [2020-07-17 13:29:23,050 INFO L264 CegarLoopResult]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse0 (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)))) (and (or .cse0 (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (not (<= 1 ~guard_malloc_counter~0.offset))) (or .cse0 (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))))) [2020-07-17 13:29:23,050 INFO L264 CegarLoopResult]: At program point L892(line 892) the Hoare annotation is: (let ((.cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base))) (let ((.cse2 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) .cse0 .cse1)) (.cse3 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse2 .cse3) (or (not (= |old(~elem~0.offset)| 0)) (not (<= 1 |list_add_#in~new.offset|)) .cse2 .cse3)))) [2020-07-17 13:29:23,050 INFO L264 CegarLoopResult]: At program point L891(lines 891 892) the Hoare annotation is: (let ((.cse0 (= list_add_~new.base |list_add_#in~new.base|)) (.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1) (not (<= 1 |list_add_#in~new.offset|)) .cse2) (or (and .cse3 .cse4) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse4) .cse2))) [2020-07-17 13:29:23,051 INFO L264 CegarLoopResult]: At program point L890(line 890) the Hoare annotation is: (let ((.cse0 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= list_add_~new.base |list_add_#in~new.base|)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1 .cse2) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse3 .cse0 .cse1 .cse2) .cse4) (or .cse3 (not (= |old(~elem~0.offset)| 0)) (not (<= 1 |list_add_#in~new.offset|)) .cse4))) [2020-07-17 13:29:23,051 INFO L264 CegarLoopResult]: At program point L891-1(line 891) the Hoare annotation is: (let ((.cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base))) (let ((.cse2 (and (= list_add_~new.base |list_add_#in~new.base|) (= |list_add_#in~new.offset| list_add_~new.offset) .cse0 .cse1)) (.cse3 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse2 .cse3) (or (not (= |old(~elem~0.offset)| 0)) (not (<= 1 |list_add_#in~new.offset|)) .cse2 .cse3)))) [2020-07-17 13:29:23,051 INFO L264 CegarLoopResult]: At program point L889(lines 889 893) the Hoare annotation is: (let ((.cse0 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse1 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse2 (= |old(~elem~0.base)| ~elem~0.base)) (.cse3 (= list_add_~new.base |list_add_#in~new.base|)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1 .cse2) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse3 .cse0 .cse1 .cse2) .cse4) (or .cse3 (not (= |old(~elem~0.offset)| 0)) (not (<= 1 |list_add_#in~new.offset|)) .cse4))) [2020-07-17 13:29:23,051 INFO L264 CegarLoopResult]: At program point L890-2(line 890) the Hoare annotation is: (and (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|)) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (not (<= 1 ~guard_malloc_counter~0.offset)))) [2020-07-17 13:29:23,051 INFO L264 CegarLoopResult]: At program point L891-3(line 891) the Hoare annotation is: (let ((.cse2 (= list_add_~new.base |list_add_#in~new.base|)) (.cse3 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (= |old(~elem~0.offset)| 0)) (and .cse2 .cse3) (not (<= 2 |list_add_#in~new.offset|)) .cse4) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse2 .cse3 .cse0 .cse1) .cse4))) [2020-07-17 13:29:23,052 INFO L264 CegarLoopResult]: At program point L890-3(line 890) the Hoare annotation is: (let ((.cse0 (= list_add_~new.base |list_add_#in~new.base|)) (.cse1 (= |list_add_#in~new.offset| list_add_~new.offset)) (.cse3 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse4 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (not (= |old(~elem~0.offset)| 0)) (and .cse0 .cse1) (not (<= 1 |list_add_#in~new.offset|)) .cse2) (or (and .cse3 .cse4) (not (<= (+ |old(~elem~0.offset)| 1) |list_add_#in~new.offset|))) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) (and .cse0 .cse1 .cse3 .cse4) .cse2))) [2020-07-17 13:29:23,052 INFO L264 CegarLoopResult]: At program point L891-4(lines 889 893) the Hoare annotation is: (let ((.cse5 (= list_add_~new.base |list_add_#in~new.base|)) (.cse6 (= |list_add_#in~new.offset| list_add_~new.offset))) (let ((.cse3 (and .cse5 .cse6 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))) (.cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (not (= |old(~elem~0.offset)| 0))) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1) .cse2 .cse3 (not (<= 1 |list_add_#in~new.offset|)) .cse4) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse3 (and .cse5 .cse6 .cse0 .cse1) .cse4) (or .cse2 (and .cse5 .cse6) (not (<= 2 |list_add_#in~new.offset|)) .cse4)))) [2020-07-17 13:29:23,052 INFO L264 CegarLoopResult]: At program point list_addEXIT(lines 889 893) the Hoare annotation is: (let ((.cse5 (= list_add_~new.base |list_add_#in~new.base|)) (.cse6 (= |list_add_#in~new.offset| list_add_~new.offset))) (let ((.cse3 (and .cse5 .cse6 (= ~elem~0.base |list_add_#in~new.base|) (= ~elem~0.offset |list_add_#in~new.offset|))) (.cse0 (= |old(~elem~0.offset)| ~elem~0.offset)) (.cse1 (= |old(~elem~0.base)| ~elem~0.base)) (.cse2 (not (= |old(~elem~0.offset)| 0))) (.cse4 (not (<= 1 ~guard_malloc_counter~0.offset)))) (and (or (and .cse0 .cse1) .cse2 .cse3 (not (<= 1 |list_add_#in~new.offset|)) .cse4) (or (not (<= (+ |list_add_#in~new.offset| 1) |old(~elem~0.offset)|)) .cse3 (and .cse5 .cse6 .cse0 .cse1) .cse4) (or .cse2 (and .cse5 .cse6) (not (<= 2 |list_add_#in~new.offset|)) .cse4)))) [2020-07-17 13:29:23,052 INFO L271 CegarLoopResult]: At program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L271 CegarLoopResult]: At program point __blast_assertEXIT(lines 4 7) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L271 CegarLoopResult]: At program point __blast_assertFINAL(lines 4 7) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset)) [2020-07-17 13:29:23,053 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:29:23,053 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0))) [2020-07-17 13:29:23,054 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 902 917) the Hoare annotation is: true [2020-07-17 13:29:23,054 INFO L264 CegarLoopResult]: At program point L909(line 909) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (= |old(~elem~0.offset)| 0)) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (<= (+ ~elem~0.offset 1) main_~dev2~0.offset)) (and (= 0 ~elem~0.offset) (<= 2 main_~dev2~0.offset) (<= 1 ~guard_malloc_counter~0.offset))) [2020-07-17 13:29:23,054 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 902 917) the Hoare annotation is: true [2020-07-17 13:29:23,054 INFO L264 CegarLoopResult]: At program point L908(line 908) the Hoare annotation is: (let ((.cse1 (<= (+ ~elem~0.offset 1) main_~dev2~0.offset))) (let ((.cse0 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (.cse3 (<= 2 main_~dev2~0.offset)) (.cse2 (let ((.cse4 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset)) (.cse5 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset))) (or (and .cse4 .cse5 .cse1) (and .cse4 (= main_~dev2~0.base ~elem~0.base) .cse5 (= main_~dev2~0.offset ~elem~0.offset)))))) (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and .cse0 .cse1 .cse2) (not (= |old(~elem~0.offset)| 0)) (and (= 0 ~elem~0.offset) .cse3 (<= 1 ~guard_malloc_counter~0.offset)) (and .cse0 .cse3 .cse2)))) [2020-07-17 13:29:23,054 INFO L264 CegarLoopResult]: At program point L907(line 907) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (= |old(~elem~0.offset)| 0)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base))) [2020-07-17 13:29:23,055 INFO L264 CegarLoopResult]: At program point L906(lines 906 915) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= 0 main_~dev1~0.base) (= 0 main_~dev1~0.offset)) (and (= 0 main_~dev2~0.offset) (= 0 ~elem~0.offset) (= main_~dev2~0.base 0) (<= 1 ~guard_malloc_counter~0.offset)) (not (= |old(~elem~0.offset)| 0)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base))) [2020-07-17 13:29:23,055 INFO L264 CegarLoopResult]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (.cse1 (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset))) (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (not (= |old(~elem~0.offset)| 0)) (and (= main_~dev2~0.base ~elem~0.base) .cse0 .cse1 (<= 2 main_~dev2~0.offset) (= main_~dev2~0.offset ~elem~0.offset) (<= 1 ~guard_malloc_counter~0.offset)) (and (<= 1 main_~dev1~0.offset) .cse0 .cse1 (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)))) [2020-07-17 13:29:23,055 INFO L264 CegarLoopResult]: At program point L905(line 905) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= 0 main_~dev1~0.base) (= 0 main_~dev1~0.offset)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)) (not (= |old(~elem~0.offset)| 0))) [2020-07-17 13:29:23,055 INFO L271 CegarLoopResult]: At program point L906-1(lines 906 915) the Hoare annotation is: true [2020-07-17 13:29:23,055 INFO L264 CegarLoopResult]: At program point L904(line 904) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0))) [2020-07-17 13:29:23,055 INFO L264 CegarLoopResult]: At program point L905-1(line 905) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= 0 main_~dev1~0.base) (= 0 main_~dev1~0.offset)) (not (= |old(~elem~0.offset)| 0)) (and (= 0 ~elem~0.offset) (= 0 |main_#t~ret33.offset|) (= 0 |main_#t~ret33.base|) (<= 1 ~guard_malloc_counter~0.offset)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset) (<= (+ main_~dev1~0.offset 1) |main_#t~ret33.offset|) (= |old(~elem~0.base)| ~elem~0.base))) [2020-07-17 13:29:23,056 INFO L264 CegarLoopResult]: At program point L903(line 903) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= 0 ~guard_malloc_counter~0.offset) (= |old(~elem~0.base)| ~elem~0.base) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (= |old(~elem~0.offset)| 0))) [2020-07-17 13:29:23,056 INFO L264 CegarLoopResult]: At program point L904-1(line 904) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset) (<= 1 |main_#t~ret32.offset|) (= |old(~elem~0.base)| ~elem~0.base)) (not (= |old(~elem~0.offset)| 0)) (and (= 0 |main_#t~ret32.base|) (= |main_#t~ret32.offset| 0))) [2020-07-17 13:29:23,056 INFO L264 CegarLoopResult]: At program point L905-2(line 905) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (let ((.cse0 (+ main_~dev1~0.offset 1))) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (<= .cse0 main_~dev2~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset) (<= .cse0 |main_#t~ret33.offset|) (= |old(~elem~0.base)| ~elem~0.base))) (and (= 0 main_~dev1~0.base) (= 0 main_~dev1~0.offset)) (not (= |old(~elem~0.offset)| 0)) (and (= 0 main_~dev2~0.offset) (= 0 ~elem~0.offset) (= 0 |main_#t~ret33.offset|) (= 0 |main_#t~ret33.base|) (= main_~dev2~0.base 0) (<= 1 ~guard_malloc_counter~0.offset))) [2020-07-17 13:29:23,056 INFO L264 CegarLoopResult]: At program point L904-2(line 904) the Hoare annotation is: (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) (and (<= 1 main_~dev1~0.offset) (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (= |old(~elem~0.offset)| ~elem~0.offset) (<= |main_#t~ret32.offset| ~guard_malloc_counter~0.offset) (<= 1 |main_#t~ret32.offset|) (= |old(~elem~0.base)| ~elem~0.base)) (not (= |old(~elem~0.offset)| 0)) (and (= 0 main_~dev1~0.base) (= 0 |main_#t~ret32.base|) (= 0 main_~dev1~0.offset) (= |main_#t~ret32.offset| 0))) [2020-07-17 13:29:23,056 INFO L264 CegarLoopResult]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (or (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1)))) [2020-07-17 13:29:23,057 INFO L264 CegarLoopResult]: At program point __getMemoryEXIT(lines 869 876) the Hoare annotation is: (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse0 (= 8 __getMemory_~size))) (or (and (<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) .cse0 (<= .cse1 |__getMemory_#res.offset|)) (let ((.cse2 (not (= 8 |__getMemory_#in~size|))) (.cse3 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse2 .cse3) (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse3))) (and (<= |__getMemory_#res.base| 0) (<= .cse1 ~guard_malloc_counter~0.offset) (<= |__getMemory_#res.offset| 0) .cse0 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)))) [2020-07-17 13:29:23,057 INFO L264 CegarLoopResult]: At program point __getMemoryFINAL(lines 869 876) the Hoare annotation is: (let ((.cse1 (+ |old(~guard_malloc_counter~0.offset)| 1)) (.cse0 (= 8 __getMemory_~size))) (or (and (<= |__getMemory_#res.offset| ~guard_malloc_counter~0.offset) .cse0 (<= .cse1 |__getMemory_#res.offset|)) (let ((.cse2 (not (= 8 |__getMemory_#in~size|))) (.cse3 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse2 .cse3) (or .cse2 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse3))) (and (<= |__getMemory_#res.base| 0) (<= .cse1 ~guard_malloc_counter~0.offset) (<= |__getMemory_#res.offset| 0) .cse0 (<= 0 |__getMemory_#res.offset|) (<= 0 |__getMemory_#res.base|)))) [2020-07-17 13:29:23,057 INFO L264 CegarLoopResult]: At program point L875(line 875) the Hoare annotation is: (or (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-07-17 13:29:23,057 INFO L264 CegarLoopResult]: At program point L874(line 874) the Hoare annotation is: (or (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-07-17 13:29:23,057 INFO L264 CegarLoopResult]: At program point L873(line 873) the Hoare annotation is: (or (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-07-17 13:29:23,058 INFO L264 CegarLoopResult]: At program point L872(line 872) the Hoare annotation is: (or (and (= |old(~guard_malloc_counter~0.offset)| |__getMemory_#t~post28.offset|) (= 8 __getMemory_~size) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1)))) [2020-07-17 13:29:23,058 INFO L264 CegarLoopResult]: At program point L873-1(lines 873 874) the Hoare annotation is: (or (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-07-17 13:29:23,058 INFO L264 CegarLoopResult]: At program point L871(line 871) the Hoare annotation is: (or (and (= 8 __getMemory_~size) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1)))) [2020-07-17 13:29:23,058 INFO L264 CegarLoopResult]: At program point L872-1(line 872) the Hoare annotation is: (or (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= |old(~guard_malloc_counter~0.offset)| |__getMemory_#t~post28.offset|) (= 8 __getMemory_~size)) (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1)))) [2020-07-17 13:29:23,058 INFO L264 CegarLoopResult]: At program point L873-2(line 873) the Hoare annotation is: (or (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-07-17 13:29:23,059 INFO L264 CegarLoopResult]: At program point L873-3(line 873) the Hoare annotation is: (or (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (= 8 __getMemory_~size))) [2020-07-17 13:29:23,059 INFO L264 CegarLoopResult]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1))) [2020-07-17 13:29:23,059 INFO L264 CegarLoopResult]: At program point L871-3(line 871) the Hoare annotation is: (or (and (= 8 __getMemory_~size) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (let ((.cse0 (not (= 8 |__getMemory_#in~size|))) (.cse1 (not (= 0 ~elem~0.offset)))) (and (or (not (= 0 |old(~guard_malloc_counter~0.offset)|)) .cse0 .cse1) (or .cse0 (not (<= 1 |old(~guard_malloc_counter~0.offset)|)) .cse1)))) [2020-07-17 13:29:23,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 01:29:23 BoogieIcfgContainer [2020-07-17 13:29:23,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 13:29:23,085 INFO L168 Benchmark]: Toolchain (without parser) took 19441.95 ms. Allocated memory was 144.7 MB in the beginning and 410.5 MB in the end (delta: 265.8 MB). Free memory was 100.3 MB in the beginning and 239.8 MB in the end (delta: -139.4 MB). Peak memory consumption was 279.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:29:23,086 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 144.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 13:29:23,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.31 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 168.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:29:23,088 INFO L168 Benchmark]: Boogie Preprocessor took 54.65 ms. Allocated memory is still 203.4 MB. Free memory was 168.1 MB in the beginning and 165.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-17 13:29:23,088 INFO L168 Benchmark]: RCFGBuilder took 617.74 ms. Allocated memory is still 203.4 MB. Free memory was 165.2 MB in the beginning and 117.5 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:29:23,089 INFO L168 Benchmark]: TraceAbstraction took 18079.05 ms. Allocated memory was 203.4 MB in the beginning and 410.5 MB in the end (delta: 207.1 MB). Free memory was 117.5 MB in the beginning and 239.8 MB in the end (delta: -122.2 MB). Peak memory consumption was 238.1 MB. Max. memory is 7.1 GB. [2020-07-17 13:29:23,093 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.97 ms. Allocated memory is still 144.7 MB. Free memory is still 119.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 684.31 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 168.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.65 ms. Allocated memory is still 203.4 MB. Free memory was 168.1 MB in the beginning and 165.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 617.74 ms. Allocated memory is still 203.4 MB. Free memory was 165.2 MB in the beginning and 117.5 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18079.05 ms. Allocated memory was 203.4 MB in the beginning and 410.5 MB in the end (delta: 207.1 MB). Free memory was 117.5 MB in the beginning and 239.8 MB in the end (delta: -122.2 MB). Peak memory consumption was 238.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 878]: Procedure Contract for my_malloc Derived contract for procedure my_malloc: ((!(8 == \old(size)) || 8 == size) && ((((\result <= guard_malloc_counter && \old(guard_malloc_counter) + 1 <= \result) || ((!(0 == \old(guard_malloc_counter)) || !(8 == \old(size))) && (!(8 == \old(size)) || !(1 <= \old(guard_malloc_counter))))) || !(0 == elem)) || (((\result <= 0 && \result <= 0) && 0 <= \result) && 0 <= \result))) && (((\old(guard_malloc_counter) + 1 <= guard_malloc_counter || ((!(0 == \old(guard_malloc_counter)) || !(8 == \old(size))) && (!(8 == \old(size)) || !(1 <= \old(guard_malloc_counter))))) || !(1 <= \old(guard_malloc_counter))) || !(0 == elem)) - ProcedureContractResult [Line: 895]: Procedure Contract for list_del Derived contract for procedure list_del: ((\old(elem) == elem && \old(elem) == elem) || \old(elem) == entry) && (((\old(elem) == elem && \old(elem) == elem) || 0 == elem) || !(1 <= guard_malloc_counter)) - ProcedureContractResult [Line: 4]: Procedure Contract for __blast_assert Derived contract for procedure __blast_assert: 1 - ProcedureContractResult [Line: 889]: Procedure Contract for list_add Derived contract for procedure list_add: ((((((\old(elem) == elem && \old(elem) == elem) || !(\old(elem) == 0)) || (((new == new && new == new) && elem == new) && elem == new)) || !(1 <= new)) || !(1 <= guard_malloc_counter)) && (((!(new + 1 <= \old(elem)) || (((new == new && new == new) && elem == new) && elem == new)) || (((new == new && new == new) && \old(elem) == elem) && \old(elem) == elem)) || !(1 <= guard_malloc_counter))) && (((!(\old(elem) == 0) || (new == new && new == new)) || !(2 <= new)) || !(1 <= guard_malloc_counter)) - ProcedureContractResult [Line: 902]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 869]: Procedure Contract for __getMemory Derived contract for procedure __getMemory: (((\result <= guard_malloc_counter && 8 == size) && \old(guard_malloc_counter) + 1 <= \result) || (((!(0 == \old(guard_malloc_counter)) || !(8 == \old(size))) || !(0 == elem)) && ((!(8 == \old(size)) || !(1 <= \old(guard_malloc_counter))) || !(0 == elem)))) || (((((\result <= 0 && \old(guard_malloc_counter) + 1 <= guard_malloc_counter) && \result <= 0) && 8 == size) && 0 <= \result) && 0 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.5s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 574 SDtfs, 804 SDslu, 2180 SDs, 0 SdLazy, 6151 SolverSat, 392 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 142 SyntacticMatches, 7 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 384 PreInvPairs, 676 NumberOfFragments, 2369 HoareAnnotationTreeSize, 384 FomulaSimplifications, 28950 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 70 FomulaSimplificationsInter, 6551 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...